Distinguishability of s-labyrinths
V. I. Grunskaya · Russian Mathematics · 2009
In this paper we consider rectangular and s -labyrinths. We investigate problems similar to classical ones in the automata theory, namely, the distinguishability of vertices and the labyrinths equivalence. We prove that for the considered class of labyrinths these problems are solvable and estimate the distinguishing word length. For rectangular labyrinths we prove that the isomorphism and equivalence relations coincide.