Sequentializing Cellular Automata
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.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
