1. V. B. Kudryavtsev, G. Kilibarda, and Š. Ušćumlić, “Systems of automata in labirynths,” Matem. Voprosy Kibernet. 14, 93–160 (2005).
2. A. V. Andzans, Behavior of Deterministic and Probabilistic Automata in Labyrinths, Candidate (Phys.–Math.) Dissertation (Riga, 1987).
3. G. Kilibarda, “On the minimum universal collectives of automata for plane labyrinths,” Discrete Math. Appl. 3 (6), 555–586 (1993).
4. G. Kilibarda, “On the minimal universal collectives of automata for plane labyrinths,” Diskr. Mat. 6 (4), 133–153 (1994).
5. A. Szepietowski, “A finite 5-pebble-automaton can search every maze,” Inform. Process. Lett. 15 (5), 199–204 (1982).