ECM - École Centrale de Marseille : UMR7373 (Pôle de l'étoile - Technopole de Château-Gombert - 38 rue Frédéric Joliot-Curie - 13013 Marseille - France)
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.
https://hal.archives-ouvertes.fr/hal-01862896 Contributor : Pierre GuillonConnect in order to contact the contributor Submitted on : Monday, September 3, 2018 - 5:28:23 PM Last modification on : Friday, February 4, 2022 - 3:24:33 AM Long-term archiving on: : Tuesday, December 4, 2018 - 6:23:43 PM
Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier. Undecidable word problem in subshift automorphism groups. Computer Science in Russia 2019, Jul 2019, Novosibirsk, Russia. ⟨hal-01862896v2⟩