|
|
|
|
References
|
|
| |
| 1. |
Kudryavtsev V.B., Uscumlic S.M., Kilibarda G., “On behaviour of automata in labyrinths”, Discrete Math. Appl., 3:1 (1993), 1–28    |
| 2. |
Kilibarda G., Kudryavtsev V.B., Uscumlic S.M.,, “Sistemy avtomatov v labirintah [Systems of automata in labyrints]”, Matematicheskie voprosy kibernetiki, 14, ed. Lupanov O.B., Fizmatlit, Moscow, 2005, 93–160 (In Russian)  |
| 3. |
Kilibarda G., Kudryavtsev V.B., Uscumlic S.M., “Collectives of automata in labyrinths”, Discrete Math. Appl., 13:5 (2003), 429–466 |
| 4. |
Budach L., “Automata and labirinths”, Math. Nachrichten, 86 (1978), 195–282 |
| 5. |
Kudryavtsev V.B.,Podkolzin A.S., Uscumlic S.M., Vvedenie v teoriyu abstractnyh avtomatov [Introduction to Abstract Automata Theory], Izd-vo MGU, Moscow, 1985 (In Russian) |
| 6. |
Hoffmann F., “One pebble does not suffice to search plane labyrinths”, Lecture Notes in Computer Science, 117, 1981, 433-444 |
| 7. |
Hoffman F., 1-Kiesel-Automaten in Labyrinthen, Report R-Math-06/82, AdW der DDR, Berlin, 1982 |
| 8. |
Kilibarda G., “Ob obhode konechnyh labirintov sistemami avtomatov [On traversing finite labyrinths by systems of automata]”, Diskretnaya matematika, 2:2 (1990), 71–81 (In Russian) |
| 9. |
Blum M., Kozen D., “On the power of the compass”, Proc. 19th IEEE FOCS Conf. (Ann Arbor, 1978), 132–142 |
| 10. |
Pultr A., Ulehla J., “On two problems of mice”, Rend. Circ. Mat. di Palermo, 31:2 (1982), 249–262 |
| 11. |
Szepietowski A., “A finite 5-pebble-automaton can search every maze”, Information Processing Letters, 15:5 (1982), 199-204 |
| 12. |
Kilibarda G., “On the minimum universal collectives of automata for plane labyrinths”, Discrete Math. Appl., 3:6 (1993), 555–586 |
| 13. |
Kilibarda G., “On Reduction of Automata in Labyrinths”, Publ. Inst. Math., Nouv. Sér., 101(115) (2017), 47–63 |
| 14. |
Hemmerling A., “Normed two-plane traps for finite systems of cooperating compass automata”, J. Inf. Process. Cybern.: EIK, 28:8/9 (1987), 453–470 |
| 15. |
Hemmerling, A., “Remark on the power of compas”, Lecture Notes in Computer Science, 233, 1986, 405–413 |
| 16. |
Vijayan G., Wigderson A., “Rectilinear graphs and their embeddings'”, SIAM J. Comput., 14 (1985), 355–372 |
| 17. |
Hoffman F., Kriegel K., Quasiplane labyrinths, Preprint P-Math-20/83, AdW der DDR, Berlin, 1983 |
| 18. |
Asser G., “Bemerkungen zum Labyrinth-Problem”, J. Inf. Process. Cybern.: EIK, 13:4/5 (1977), 203–216 |
