1. L. Budach, On the Solution of the labyrinth Problem for Finite Automata, EIK 11 (1975), 10–12, 661–672
2. —, Automata and Labyrinths, Mimeographed notes (Math. Nachr., forthcoming)
3. V.M. Gluskov, A.A. Letičevskij, Teorija diskretnych preobrazovatelej, Selected Questions of Algebra and Logic, Nauka, Novosibirsk 1973
4. W.J. Savitch, Maze Recognizing Automata and Nondeterministic Tape Complexity, J. of Computer and System Science 7 (1973), 389–403
5. C.P. Schnorr, Rekursive Funktionen ünd ihre Komplexität Teubner, Stuttgart, 1974