Aug 28, 2018 · Abstract:This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any ...

May 16, 2019 · This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts.

Sep 3, 2018 · Abstract. This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any ...

Abstract. This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts.

PDF | This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts. We show in.

This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts. We show in particular ...

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, ...

It is shown that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree.

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, ...

This article studies the complexity of the word problem in groups of automorphisms (or reversible cellular automata) of subshifts. We show in particular ...