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, 1993, Volume 5, Issue 3, Pages 116–124 (Mi dm697)  

This article is cited in 3 scientific papers (total in 3 papers)

On the complexity of traversing labyrinths by an automaton

G. Kilibarda
Full-text PDF (990 kB) Citations (3)
Abstract: The class of all finite labyrinths with finite holes with diameter no larger than a given natural number $n$ was considered by S. A. Bogomolov, A. A. Zolotykh and A. N. Zyrychev [Avtomaty i grafy (Automata and graphs), Saratov. Univ., Saratov, 1991; per bibl.]. They showed that a universal shunt having no more than $Cn^2$ states exists for this class. In this paper we give a more efficient bypass algorithm than the one in the above-cited book. We construct a universal shunt for this class that has $Cn$ states.
Received: 31.03.1992
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: G. Kilibarda, “On the complexity of traversing labyrinths by an automaton”, Diskr. Mat., 5:3 (1993), 116–124
Citation in format AMSBIB
\Bibitem{Kil93}
\by G.~Kilibarda
\paper On the complexity of traversing labyrinths by an automaton
\jour Diskr. Mat.
\yr 1993
\vol 5
\issue 3
\pages 116--124
\mathnet{http://mi.mathnet.ru/dm697}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1266264}
\zmath{https://zbmath.org/?q=an:0853.68134}
Linking options:
  • https://www.mathnet.ru/eng/dm697
  • https://www.mathnet.ru/eng/dm/v5/i3/p116
  • 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
    Дискретная математика
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024