preprint · arXiv (Cornell University) · 2018

Undecidable word problem in subshift automorphism groups

P. Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier

Cited by 0Open access

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.

Cite this paper

APA 7

Guillon, P., Jeandel, E., Kari, J., & Vanier, P. (2018). Undecidable word problem in subshift automorphism groups. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1808.09194

MLA 9

Guillon, P., et al. “Undecidable word problem in subshift automorphism groups.” arXiv (Cornell University), 2018, https://doi.org/10.48550/arxiv.1808.09194.

Chicago

Guillon, P., Emmanuel Jeandel, Jarkko Kari, and Pascal Vanier. 2018. “Undecidable word problem in subshift automorphism groups.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1808.09194.

Harvard

Guillon, P. et al. (2018) ‘Undecidable word problem in subshift automorphism groups’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1808.09194.

BibTeX

@misc{guillon2018undecidable,
  title = {{Undecidable word problem in subshift automorphism groups}},
  author = {Guillon, P. and Jeandel, Emmanuel and Kari, Jarkko and Vanier, Pascal},
  journal = {arXiv (Cornell University)},
  year = {2018},
  doi = {10.48550/arxiv.1808.09194}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.