On recognizing labyrinths by automata

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.