×

Determination of systems of graphs and the synthesis of finite automata. (English. Russian original) Zbl 0158.25902

Sib. Math. J. 7, 994-1000 (1966); translation from Sib. Mat. Zh. 7, 1259-1267 (1966).
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] V. M. Glushkov, Abstract Theory of Automata, Uspekhi matem. nauk,16, No. 5, 3?62 (1961).
[2] O. B. Lupanov, A Comparison of Two Types of Finite Sources, Problemy kibernetiki, No. 9, 321?327 (1963). · Zbl 0126.32605
[3] 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).
[4] C. Berge, Théorie des Graphes et ses Applications [in Russian translation], IL, Moscow (1962).
[5] Yu. I. Lyubich, Estimates for the Optimum Determination of Indeterminate Autonomous Automata, Sib. Matem. Zhur.,5, No. 2, 337?355 (1964). · Zbl 0192.08104
[6] 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).
[7] V. M. Glushkov, The Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962). · Zbl 0104.35404
[8] 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).
[9] 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).
[10] V. S. Grinberg, Some New Estimates in the Theory of Finite Automata, Doklady Akad. Nauk SSSR,166, No. 5, 1066?1068 (1966).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.