Automaticity and invariant measures of linear cellular automata

We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}p^{\mathbb Z} \to {\mathbb F}p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which are eventually constant. Each automatic spacetime diagram defines a $(\sigma, \Phi)$-invariant subset of ${\mathbb F}p^{\mathbb Z}$, where $\sigma$ is the left shift map, and if the initial condition is not eventually periodic then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\sigma, \Phi)$-invariant measures on ${\mathbb F}3^{\mathbb Z}$. Finally, given a linear cellular automaton $\Phi$, we construct a nontrivial $(\sigma, \Phi)$-invariant measure on ${\mathbb F}_p^{\mathbb Z}$ for all but finitely many $p$.