Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Kuipers, “The Spatial Semantic Hierarchy,” Artificial Intelligence 119(1–2), 191–233 (2000).
G. Kilibarda, V. B. Kudryavtsev, and Shch. Ushchumlich, “Independent Systems of Automata in Labyrinths,” Diskretn.Matem. 15(2), 3–39 (2003).
V. I. Grunskaya, “The Distinguishability of Plane Chess Labyrinths,” Intellectual’nye Sistemy 8, 457–464 (2004).
S. V. Sapunov, “An Equivalence of Labeled Graphs,” Trudy IPMMNANU 7, 162–167 (2002).
S. V. Sapunov, “Control of Labeled Graphs,” Trudy IPMMNANU 8, 106–110 (2003).
F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969; Mir, Moscow, 1973).
V. B. Kudryavtsev, S. V. Aleshin, and A. S. Podkolzin, An Introduction to the Theory of Finite Automata (Nauka, Moscow, 1985) [in Russian].
V. I. Grunskaya, “Realizability ofWords in Mosaic Labyrinths,” Izv. Vyssh. Uchebn. Zaved.Mat., No. 8, 19–25 (2009) [Russian Mathematics (Iz. VUZ) 53 (8), 15–19 (2009)].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.I. Grunskaya, 2009, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, No. 10, pp. 14–22.
About this article
Cite this article
Grunskaya, V.I. Distinguishability of s-labyrinths. Russ Math. 53, 11–17 (2009). https://doi.org/10.3103/S1066369X09100028
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X09100028