论文信息 - Group-Walking Automata

Group-Walking Automata

In the setting of symbolic dynamics on discrete finitely generated infinite groups, we define a model of multi-headed finite automata that walk on Cayley graphs, 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.

Ville Salo | Ilkka Törmä | Ilkka Törmä | V. Salo

[1] R. Gorenflo,et al. Multi-index Mittag-Leffler Functions , 2014 .

[2] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[3] Narain Gupta,et al. On the Burnside problem for periodic groups , 1983 .

[4] Jacques Mazoyer,et al. Pebble Automata. Figures Families Recognition and Universality , 2002, Fundam. Informaticae.

[5] Michel Coornaert,et al. Cellular Automata and Groups , 2010, Encyclopedia of Complexity and Systems Science.

[6] Ville Salo,et al. Plane-Walking Automata , 2014, Automata.

[7] R. Grigorchuk,et al. Bernside's problem on periodic groups , 1980 .

[8] Antonio Machì,et al. Cellular automata and groups (Springer Monographs in Mathematics) , 2011 .

[9] Emmanuel Jeandel. Some Notes about Subshifts on Groups , 2015, ArXiv.

[10] Nathalie Aubrun,et al. A notion of effectiveness for subshifts on finitely generated groups , 2014, Theor. Comput. Sci..

[11] S. I. Adian. The Burnside problem on periodic groups and related questions , 2011 .

[12] Rich Schroeppel,et al. A Two Counter Machine Cannot Calculate 2N , 1972 .