Literature Cited
V. M. Glushkov, Abstract Theory of Automata, Uspekhi matem. nauk,16, No. 5, 3–62 (1961).
O. B. Lupanov, A Comparison of Two Types of Finite Sources, Problemy kibernetiki, No. 9, 321–327 (1963).
Yu. L. Ershov, On the Hypothesis of V. A. Uspenskii, Algebra and Logic (Seminar of the Institute of Mathematics of the Siberian Division of the Academy of Sciences of the USSR),1, No. 4, 45–48 (1962).
C. Berge, Théorie des Graphes et ses Applications [in Russian translation], IL, Moscow (1962).
Yu. I. Lyubich, Estimates for the Optimum Determination of Indeterminate Autonomous Automata, Sib. Matem. Zhur.,5, No. 2, 337–355 (1964).
G. M. Karpelevich, On the Relationship Between the Concepts of Solvability and Enumerability for Finite Automata, Doklady Akad. Nauk SSSR,149, No. 5, 1023–1025 (1963).
V. M. Glushkov, The Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies [in Russian translation], Collection of papers “Avtomaty,” IL, Moscow, 7–16 (1956).
Yu. I. Lyubich and É. M. Livshits, Estimates of the Weight of a Regular Event over a One-Letter Alphabet, Sib. Matem. Zhurn.,6, No. 1, 122–126 (1965).
V. S. Grinberg, Some New Estimates in the Theory of Finite Automata, Doklady Akad. Nauk SSSR,166, No. 5, 1066–1068 (1966).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 7, No. 6, pp. 1259–1267, November–December, 1966.
Rights and permissions
About this article
Cite this article
Grinberg, V.S. Determination of systems of graphs and the synthesis of finite automata. Sib Math J 7, 994–1000 (1966). https://doi.org/10.1007/BF00966396
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00966396