Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2000, Volume 12, Issue 2, Pages 51–65
DOI: https://doi.org/10.4213/dm335 (Mi dm335) 		 
This article is cited in 3 scientific papers (total in 3 papers)

On recognizing labyrinths by automata

B. Stamatovic
Full-text PDF (1116 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm335
Abstract: We consider the problem of existence of automata which recognize some rectangular labyrinths. We prove that there is no automaton, which recognizes simple rectangular labyrinths, what is not so for mosaic labyrinths. We describe an infinite class of $\pi$-labyrinths, which are not recognizable by automata.
Received: 17.05.1999
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: B. Stamatovic, “On recognizing labyrinths by automata”, Diskr. Mat., 12:2 (2000), 51–65; Discrete Math. Appl., 10:2 (2000), 203–218
Citation in format AMSBIB
\Bibitem{Sta00}
\by B.~Stamatovic
\paper On recognizing labyrinths by automata
\jour Diskr. Mat.
\yr 2000
\vol 12
\issue 2
\pages 51--65
\mathnet{http://mi.mathnet.ru/dm335}
\crossref{https://doi.org/10.4213/dm335}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1783074}
\zmath{https://zbmath.org/?q=an:0966.68102}
\transl
\jour Discrete Math. Appl.
\yr 2000
\vol 10
\issue 2
\pages 203--218
Linking options:
  • https://www.mathnet.ru/eng/dm335
  • https://doi.org/10.4213/dm335
  • https://www.mathnet.ru/eng/dm/v12/i2/p51
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:455
    Full-text PDF :198
    References:52
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024