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

DOI10.1515/DMA.2000.10.6.597zbMATH Open1088.68639OpenAlexW1975221557MaRDI QIDQ4809507FDOQ4809507

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Multidimensional labyrinth -- multidimensional virtual reality
• Probabilistic methods of bypass of the labyrinth using stones and random number generator
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving the KO labyrinth
• Title not available (Why is that?)
• On the traversal of labyrinths by automata leaving unremovable labels
• Capabilities of automata upon traversing a plane
• On reduction of automata in labyrinths

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)