Automaton recognition of doubly connected labyrinths with finite cyclic diameter
Biljana Stamatovic · Programming and Computer Software · 2010
The problem of existence of a recognizing automaton for a subclass of an infinite class of chess labyrinths (denoted as C 0) is studied. It is proved in [1] that, for C 0, there does not exist a recognizing automaton. In [2], it is proved that there exists a recognizing collective of type (1, 1) (collective consisting of an automaton and stone). In this paper, it is proved that there exists a recognizing automaton for some subclass of the class of chess labyrinths with finite cyclic diameter.