Decision problems for cellular automata and their semigroups
We associate to every one-dimensional cellular automaton a finitely presented semigroup. This semigroup is shown to have solvable word problem if and only if the common descendant problem is solvable for the cellular automaton. Connections with Culik and Yu's classification of cellular automata are investigated.
KeywordsCellular Automaton Word Problem Infinite Sequence Reduction Sequence Solvable Word Problem
Unable to display preview. Download preview PDF.