Some problems in the synthesis of digital automata
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 1 (1961) no. 3, pp. 371-411
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{ZVMMF_1961_1_3_a0,
author = {V. M. Glushkov},
title = {Some problems in the synthesis of digital automata},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {371--411},
publisher = {mathdoc},
volume = {1},
number = {3},
year = {1961},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_3_a0/}
}
V. M. Glushkov. Some problems in the synthesis of digital automata. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 1 (1961) no. 3, pp. 371-411. http://geodesic.mathdoc.fr/item/ZVMMF_1961_1_3_a0/