2 papers
math.DS2019
On the Conjugacy Problem of Cellular Automata
Joonatan Jalonen, Jarkko Kari
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjug…
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-…