On the traversal of labyrinths in n-dimensional space by automata

DOI10.1515/DMA.2000.10.6.597MaRDI QIDQ4809507zbMATHOpenAlexFDO

Authors A. Z. Nasyrov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2000.10.6.597

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the traversal of labyrinths by automata leaving unremovable labels
• scientific article; zbMATH DE number 647638
• scientific article; zbMATH DE number 647644
• On reduction of automata in labyrinths
• On recognizing labyrinths by automata

Cited in

(9)

• scientific article; zbMATH DE number 647644 (Why is no real title available?)
• Probabilistic methods of bypass of the labyrinth using stones and random number generator
• scientific article; zbMATH DE number 647638 (Why is no real title available?)
• On reduction of automata in labyrinths
• scientific article; zbMATH DE number 194193 (Why is no real title available?)
• Capabilities of automata upon traversing a plane
• Multidimensional labyrinth -- multidimensional virtual reality
• Solving the KO labyrinth
• On the traversal of labyrinths by automata leaving unremovable labels

This page was built for publication: On the traversal of labyrinths in n-dimensional space by automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809507)