Sequentializing Cellular Automata
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single left-to-right sweep of a bijective rule from left to right over an infinite tape.
The authors gratefully acknowledge partial support for this work by two short term scientific missions of the EU COST Action IC1405.
- 1.Kari, J., Salo, V., Worsch, T.: Sequentializing cellular automata. ArXiv e-prints, February 2018. arxiv.org/abs/1802.06668