| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437223 | Theoretical Computer Science | 2012 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
