Moscow University Mathematics Bulletin

, Volume 74, Issue 5, pp 198–201 | Cite as

The Labeling Graphs of Definite Automata

  • R. A. IshchenkoEmail author
Brief Communications


Au algorithm of labeling a directed graph so that the obtained transition graph represents a definite automaton is described.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. A. Ishchenko, “Graphs of Group Automations,” Intellekt. SLstemy 21 (2), 111 (2017).Google Scholar
  2. 2.
    A. Ginzburg “About Sonic Properties of Définit e, Reverse-Defmite and Related Automata,” IEEE Trans. Electronic Computers 15, 806 (1966).CrossRefGoogle Scholar
  3. 3.
    M. Perles, M. O. Rabin, and E. Shamir, “Theory of Definite Automate,” IEEE Trans. Electronic Computers 12, 233 (1963).MathSciNetCrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2019

Authors and Affiliations

  1. 1.Faculty of Mechanics and MathematikMoscow State UniversityMoscowRussia

Personalised recommendations