Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
