Independent finite automata on Cayley graphs



: Salo V, Torma I

Publisher: SPRINGER

: GZ DORDRECHT

: 2017

: Natural Computing

: NATURAL COMPUTING

: NAT COMPUT

: 16

: 3

: 411

: 426

: 16

: 1567-7818

: 1572-9796

DOI: https://doi.org/10.1007/s11047-017-9613-6


In the setting of symbolic dynamics on discrete finitely generated infinite groups, we define a model of finite automata with multiple independent heads that walk on Cayley graphs, called group-walking automata, and use it to define subshifts. We characterize the torsion groups (also known as periodic groups) as those on which the group-walking automata are strictly weaker than Turing machines, and those on which the head hierarchy is infinite.



Last updated on 2024-26-11 at 15:09