Collectives of Automata in Finitely Generated Groups

D. V. Gusev, I. A. Ivanov-Pogodaev, A. Ya Kanel-Belov

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)671-678
Number of pages8
JournalMathematical Notes
Volume108
Issue number5-6
DOIs
StatePublished - Nov 2020

Bibliographical note

Publisher Copyright:
© 2020, Pleiades Publishing, Ltd.

Keywords

  • Burnside groups
  • finite automata
  • maze traversing
  • robots in mazes

Fingerprint

Dive into the research topics of 'Collectives of Automata in Finitely Generated Groups'. Together they form a unique fingerprint.

Cite this