Sequentializing cellular automata
Dynamical Systems
2018-04-09 v2 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1802.06668,
title = {Sequentializing cellular automata},
author = {Jarkko Kari and Ville Salo and Thomas Worsch},
journal= {arXiv preprint arXiv:1802.06668},
year = {2018}
}
Comments
24 pages; corrected typos and wording