A new kind of science
Theory of cellular automata: a survey
Theoretical Computer Science
Cellular automata, the collatz conjecture and powers of 3/2
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |
We construct a reversible, one-dimensional cellular automaton that has the property that a finite initial configuration generates all finite patterns over its state alphabet. We also conjecture that a related cellular automaton satisfies the stronger property that every finite pattern gets generated in every position, so that the forward orbit of the finite initial configuration is dense.