Work

Undecidable word problem in subshift automorphism groups

Year: 2018

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1808.09194

Authors: Guillon, Pierre, Jeandel, Emmanuel, Kari, Jarkko, Vanier, Pascal

Institutions: Institut de Mécanique et d'Ingénierie de Bordeaux, Laboratoire d'Algorithmique, Complexité et Logique

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4308935115

Cites:

Cited by:

Related to: 10