RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 1961 Volume 1, Number 3, Pages 371–411 (Mi zvmmf7970)

This article is cited in 7 papers

Some problems in the synthesis of digital automata

V. M. Glushkov

Kiev

Abstract: The rapid growth of modern discrete computing techniques has made heavy demands on the theory of the network synthesis of discrete processers of information or, as we shall call them, digital automata. Of course processers of this kind can operate on arbitrary symbolic information instead of digital information, but the term “digital automata” has already taken root, and we do not wish to break with established tradition. The procedure for the network synthesis of modern digital automata can be divided into a number of independent stages.

Received: 01.02.1961


 English version:
USSR Computational Mathematics and Mathematical Physics, 1962, 1:3, 399–446

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026