Undecidable word problem in subshift automorphism groups - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Undecidable word problem in subshift automorphism groups

Pierre Guillon
Jarkko Kari

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.
Fichier principal
Vignette du fichier
wordpb.pdf (163.79 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01862896 , version 1 (27-08-2018)
hal-01862896 , version 2 (03-09-2018)

Identifiers

Cite

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⟩
316 View
263 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More