23 citations · 100 across the 28 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Undecidable word problem in subshift automorphism groups
Pierre Guillon, Emmanuel Jeandel, Jarkko Kari +1
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 aut…
cs.CC2017
Conjugacy of one-dimensional one-sided cellular automata is undecidable
Joonatan Jalonen, Jarkko Kari
Two cellular automata are strongly conjugate if there exists a shift-commuting conjugacy between them. We prove that the following two sets of pairs of one-dimensional one-…