Skip to main content
SpringerLink
Log in

Automaton recognition of doubly connected labyrinths with finite cyclic diameter

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The problem of existence of a recognizing automaton for a subclass of an infinite class of chess labyrinths (denoted as C 0) is studied. It is proved in [1] that, for C 0, there does not exist a recognizing automaton. In [2], it is proved that there exists a recognizing collective of type (1, 1) (collective consisting of an automaton and stone). In this paper, it is proved that there exists a recognizing automaton for some subclass of the class of chess labyrinths with finite cyclic diameter.

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

Similar content being viewed by others

References

  1. Stamatovich, B., Recognizing Labyrinths by Automata, Diskretnaya Mat., 2000, vol. 12,issue 2, pp. 51–65.

    MathSciNet  Google Scholar 

  2. Stamatovich, B., Recognizing Doubly Connected Digits by Collectives of Automata, Intelektual’nye Sistemy, 1999, vol. 4,issue 1–2, pp. 321–337.

    Google Scholar 

  3. Kudryavtsev, V.B., Alekshin, S.V., and Podkolzin, A.S., Vvedenie v teoriyu avtomatov (Introduction to Automaton Theory), Moscow: Nauka, 1985.

    MATH  Google Scholar 

  4. Kilibarda, G., On Universal Trap-Algorithms for Finite Sets of Automata, Diskretnaya Mat., 1990, vol. 2,issue 1, pp. 72–79.

    MATH  MathSciNet  Google Scholar 

  5. Kudryavtsev, V.B., Ushchumlich, Sh., and Kilibarda, G., On Behavior of Automata in Labyrinths, Diskretnaya Mat., 1992, vol. 3,issue 1, pp. 3–29.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Technologies, Donya Goritsa University, Montenegro, Russia

    B. Stamatovich

Authors
  1. B. Stamatovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Stamatovich.

Additional information

Original Russian Text © B. Stamatovich, 2010, published in Programmirovanie, 2010, Vol. 36, No. 3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stamatovich, B. Automaton recognition of doubly connected labyrinths with finite cyclic diameter. Program Comput Soft 36, 149–156 (2010). https://doi.org/10.1134/S0361768810030035

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768810030035

Keywords

Search

Navigation