|
This article is cited in 3 scientific papers (total in 3 papers)
On recognizing labyrinths by automata
B. Stamatovic
Abstract:
We consider the problem of existence of automata which recognize some rectangular labyrinths.
We prove that there is no automaton, which recognizes simple rectangular labyrinths, what is not so for mosaic labyrinths. We describe an infinite class of $\pi$-labyrinths, which are not recognizable by automata.
Received: 17.05.1999
Citation:
B. Stamatovic, “On recognizing labyrinths by automata”, Diskr. Mat., 12:2 (2000), 51–65; Discrete Math. Appl., 10:2 (2000), 203–218
Linking options:
https://www.mathnet.ru/eng/dm335https://doi.org/10.4213/dm335 https://www.mathnet.ru/eng/dm/v12/i2/p51
|
Statistics & downloads: |
Abstract page: | 455 | Full-text PDF : | 198 | References: | 52 | First page: | 1 |
|