This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts. We show in particular that for any computably enumerable Turing degree, there exists a (two-dimensional) subshift of finite type whose automorphism group contains a subgroup whose word problem has exactly this degree. In particular, there are such subshifts of finite type where this problem is uncomputable. This remains true in a large setting of subshifts over groups.
CITATION STYLE
Guillon, P., Jeandel, E., Kari, J., & Vanier, P. (2019). Undecidable word problem in subshift automorphism groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11532 LNCS, pp. 180–190). Springer Verlag. https://doi.org/10.1007/978-3-030-19955-5_16
Mendeley helps you to discover research relevant for your work.