 |
Conference papers
Undecidable word problem in subshift automorphism groups
Abstract : This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree.
Cited literature [9 references]
https://hal.archives-ouvertes.fr/hal-01862896
Contributor : Pierre Guillon <>
Submitted on : Monday, September 3, 2018 - 5:28:23 PM
Last modification on : Thursday, January 23, 2020 - 6:22:13 PM
Document(s) archivé(s) le : Tuesday, December 4, 2018 - 6:23:43 PM
Contributor : Pierre Guillon <>
Submitted on : Monday, September 3, 2018 - 5:28:23 PM
Last modification on : Thursday, January 23, 2020 - 6:22:13 PM
Document(s) archivé(s) le : Tuesday, December 4, 2018 - 6:23:43 PM
Files
wordpb.pdf
Files produced by the author(s)
