2000 character limit reached
A characterization of $p$-automatic sequences as columns of linear cellular automata (1209.6008v2)
Published 26 Sep 2012 in math.DS, cs.FL, and nlin.CG
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.