arXiv · 1209.6008
A characterization of $p$-automatic sequences as columns of linear cellular automata
Abstract
We show that a sequence over a finite field $\mathbb F_q$ of characteristic $p$ is $p$-automatic if and only if it occurs as a column of the spacetime diagram, with eventually periodic initial conditions, of a linear cellular automaton with memory over $\mathbb F_q$. As a consequence, the subshift generated by a length-$p$ substitution can be realized as a topological factor of a linear cellular automaton.
Explore related subjects
Keep this discovery
Eric Rowland, Reem Yassawi. 2012-09-26. A characterization of $p$-automatic sequences as columns of linear cellular automata. https://doi.org/10.1016/j.aam.2014.10.002
Cite the original work for its findings. Save a collection to share your selection of sources.