Skip to main content
SpringerLink
Log in

The Labeling Graphs of Definite Automata

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R. A. Ishchenko, “Graphs of Group Automations,” Intellekt. SLstemy 21 (2), 111 (2017).

    Google Scholar 

  2. A. Ginzburg “About Sonic Properties of Définit e, Reverse-Defmite and Related Automata,” IEEE Trans. Electronic Computers 15, 806 (1966).

    Article  Google Scholar 

  3. M. Perles, M. O. Rabin, and E. Shamir, “Theory of Definite Automate,” IEEE Trans. Electronic Computers 12, 233 (1963).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematik, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    R. A. Ishchenko

Authors
  1. R. A. Ishchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. A. Ishchenko.

Additional information

Russian Text © The Author(s), 2019, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2019, Vol. 74, No. 5, pp. 44–48.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ishchenko, R.A. The Labeling Graphs of Definite Automata. Moscow Univ. Math. Bull. 74, 198–201 (2019). https://doi.org/10.3103/S002713221905005X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S002713221905005X

Search

Navigation