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 4, Pages 121–137
DOI: https://doi.org/10.4213/dm352 (Mi dm352) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On traversing labyrinths by automata in $n$-dimensional space

A. Z. Nasyrov
Full-text PDF (1909 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm352
Abstract: The problem of traversing spatial labyrinths by automata is considered. It is proved that there exists an automaton that makes one unremovable mark (colour) on vertices of a labyrinth and traverses an arbitrary $n$-dimensional rectangular labyrinth.
Received: 26.06.2000
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. Z. Nasyrov, “On traversing labyrinths by automata in $n$-dimensional space”, Diskr. Mat., 12:4 (2000), 121–137; Discrete Math. Appl., 10:6 (2000), 597–612
Citation in format AMSBIB
\Bibitem{Nas00}
\by A.~Z.~Nasyrov
\paper On traversing labyrinths by automata in $n$-dimensional space
\jour Diskr. Mat.
\yr 2000
\vol 12
\issue 4
\pages 121--137
\mathnet{http://mi.mathnet.ru/dm352}
\crossref{https://doi.org/10.4213/dm352}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1826184}
\zmath{https://zbmath.org/?q=an:1088.68639}
\transl
\jour Discrete Math. Appl.
\yr 2000
\vol 10
\issue 6
\pages 597--612
Linking options:
  • https://www.mathnet.ru/eng/dm352
  • https://doi.org/10.4213/dm352
  • https://www.mathnet.ru/eng/dm/v12/i4/p121
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:407
    Full-text PDF :237
    References:43
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024