Abstract
The present paper is devoted to traversing a maze by a collective of automata. This part of automata theory gave rise to a fairly wide range of diverse problems ([1], [2]), including those related to problems of the theory of computational complexity and probability theory. It turns out that the consideration of complicated algebraic objects, such as Burnside groups, can be interesting in this context. In the paper, we show that the Cayley graph a finitely generated group cannot be traversed by a collective of automata if and only if the group is infinite and its every element is periodic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. B. Kudryavtsev, G. Kilibarda, and Š. Ušćumlić, “Systems of automata in labirynths,” Matem. Voprosy Kibernet. 14, 93–160 (2005).
A. V. Andzans, Behavior of Deterministic and Probabilistic Automata in Labyrinths, Candidate (Phys.–Math.) Dissertation (Riga, 1987).
G. Kilibarda, “On the minimum universal collectives of automata for plane labyrinths,” Discrete Math. Appl. 3 (6), 555–586 (1993).
G. Kilibarda, “On the minimal universal collectives of automata for plane labyrinths,” Diskr. Mat. 6 (4), 133–153 (1994).
A. Szepietowski, “A finite 5-pebble-automaton can search every maze,” Inform. Process. Lett. 15 (5), 199–204 (1982).
G. Kilibarda and Š. Ušćumlić, “Labyrinth traps for groups of automata,” Diskr. Mat. 5 (2), 29–50 (1993).
P. S. Novikov and S. I. Adian, “On infinite periodic groups. I,” Izv. AN SSSR. Ser. Matem. 32 (1), 212–244 (1968); “On infinite periodic groups. II,” Izv. AN SSSR. Ser. Matem. 32 (2), 251–524 (1968); “On infinite periodic groups. III,” Izv. AN SSSR. Ser. Matem. 32 (3), 709–731 (1968).
V. B. Kudryavtsev, A. S. Podkolzin and Š. Ušćumlić, “Introduction to Abstract Automata Theory,” (Izd. Moskov. Univ., Moscow, 1985) [in Russian].
V. B. Kudryavtsev, S. V. Aleshin and A. S. Podkolzin, “Introduction to Auomata Theory,” (Nauka, Moscow, 1985) [in Russian].
F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1968).
W. Burnside, “On an unsettled question in the theory of discontinuous groups,” Quart. J. 33, 230–238 (1902).
I. N. Sanov, “Solution of the Burnside problem for the exponent 4,” Uch. Zap. Leningr. Gos. Un-ta. Ser. Matem. 10, 166–170 (1940).
M. Hall Jr., “Solution of the Burnside problem for exponent six,” Illinois J. Math 2, 764–786 (1958).
E. S. Golod, “On nil-algebras and finitely approximable \(p\)-groups,” Izv. Akad. Nauk SSSR Ser. Mat. 28 (2), 273–276 (1964).
S. I. Adian, The Burnside Problem and Identities in Groups (Springer- Verlag, Berlin Heidelberg, 1975).
S. I. Adian, “New Estimates of Odd Exponents of Infinite Burnside Groups,” Proc. Steklov Inst. Math. 289, 33–71 (2015).
S. Ivanov, “The free Burnside groups of sufficiently large exponents,” Internat. J. Algebra Comput. 4 (1), 1–307 (1994).
I. G. Lysenok, “Infinite Burnside groups of even exponent,” Izv. Math. 60 (3), 453–654 (1996).
Funding
This work was supported by the Russian Science Foundation under grant 17-11-01377.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gusev, D.V., Ivanov-Pogodaev, I.A. & Kanel-Belov, A.Y. Collectives of Automata in Finitely Generated Groups. Math Notes 108, 671–678 (2020). https://doi.org/10.1134/S000143462011005X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S000143462011005X