HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Undecidable word problem in subshift automorphism groups

Pierre Guillon 1 Emmanuel Jeandel 2 Jarkko Kari 3 Pascal Vanier 4
1 I2M - Institut de Mathématiques de Marseille
2 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
3 University of Turku
4 LACL - Laboratoire d'Algorithmique Complexité et Logique
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-01862896
Contributor : Pierre Guillon Connect 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

Files

Vignette du document
wordpb.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01862896, version 2
  • ARXIV : 1808.09194

Collections

CNRS | EC-MARSEILLE | INSMI | I2M-2014- | TDS-MACS | UPEC-UPEM | I2M | LACL | UNIV-AMU | LORIA | LORIA-FM | INRIA | UNIV-LORRAINE | UPEC | INRIA2

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

269

Files downloads

206