EMIS ELibM Electronic Journals Publications de l’Institut Mathématique, Nouvelle Série
Vol. 101[115], pp. 47–63 (2017)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home


Pick a mirror



Goran Kilibarda

Faculty of Project and Innovation Management, EDUCONS University, Belgrade, Serbia

Abstract: It is shown that every automaton acceptable for rectangular labyrinths can be reduced to an automaton that behaves according to either the left-hand rule or the right-hand rule, or does not move at all, in every plane rectangular labyrinth without leaves. This enables us to approach certain fundamental problems of the theory of automata in labyrinths in quite a different way.

Keywords: automaton; labyrinth; behavior of automata in labyrinths

Classification (MSC2000): 68Q99

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 24 Apr 2017. This page was last modified: 11 May 2017.

© 2017 Mathematical Institute of the Serbian Academy of Science and Arts
© 2017 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition