Probabilistic methods of bypass of the labyrinth using stones and random number generator

MaRDI QIDQ5110113zbMATH OpenFDO

Authors Elizaveta Grigor'Evna Kondakova, A. Ya Belov

Publication date 15 May 2020

Full work available at URL http://mathnet.ru/eng/cheb813

zbMATH Keywords

finite state machinemaze traversal

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Behavior of finite automata in mazes
• On the traversal of labyrinths in n-dimensional space by automata
• scientific article; zbMATH DE number 647644
• On the traversal of labyrinths by automata leaving unremovable labels
• scientific article; zbMATH DE number 647638

Cites work

• scientific article; zbMATH DE number 647638 (Why is no real title available?)
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• Systems of automata in labyrinths

Cited in

(2)

• Behavior of finite automata in mazes
• Alekseĭ Yakovlevich Kanel'-Belov

This page was built for publication: Probabilistic methods of bypass of the labyrinth using stones and random number generator

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