|
Finite collective of finite automata can not explore the Calley graph of a finitely periodic generated group
A. Ya. Belov
Abstract:
It is shown that the Cayley graph of infinite periodic groups cannot be circumvented by any system of finite automata. If there is a non-periodic element such a detour exists.
At the same time, a system of one Robot and three stones is enough if aperiodic element exist.
Keywords:
Robots in labyrinths, finite automata, periodic groups, Burnside problem.
Received: 10.12.2018
Linking options:
https://www.mathnet.ru/eng/mzm12282
|
| Statistics & downloads: |
| Abstract page: | 150 |
|