Sequentializing cellular automata
classification
🧮 math.DS
cs.FL
keywords
cellularautomatasequentializingtapeautomatonbijectivecharacterizationdecidable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.