arXiv:1812.00716 Abstract | arXiv Analytics

arXiv:1812.00716 [math.GR]Abstract References Reviews Resources

Automata system in finitelly generated groups

Published 2018-12-03Version 1

We prove that any finite system of interacted automata can not leave some finite arrear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If group is finitelly generated and aperiodic then it can not be explored by any system of finite automata.

Comments: 12 pages, in Russian, supported by Russian Science Foundation, grant No 17-11-01377

Categories: math.GR, math.LO

Subjects: 20F10

Keywords: finitelly generated groups, automata system, finite automata, calley graph, finite arrear

Related articles: Most relevant | Search more

arXiv:1112.5709 [math.GR] (Published 2011-12-24)

Finite automata for Schreier graphs of virtually free groups

Pedro Silva, Xaro Soler-Escrivà, Enric Ventura

arXiv:1811.02115 [math.GR] (Published 2018-11-03)

Examples of defining groups by finite automata

Victoriia Korchemna

arXiv:1511.01630 [math.GR] (Published 2015-11-05)