Linear cellular automata and recurring sequences in finite fields (Q5966489): Difference between revisions

Using the approach of \textit{O. Martin}, \textit{A. M. Odlyzko} and \textit{S. Wolfram} [Commun. Math. Phys. 93, 219-258 (1984; Zbl 0564.68038)] and building on earlier results on cylindrical cellular automata [Commun. Math. Phys. 118, No.4, 569-590 (1988; Zbl 0655.68060)], the author investigates the detailed algebraic structure of limit cycles generated by linear automata. In the process, it is shown that the techniques of recurring sequences are easy to apply to the analysis of cylindrical cellular automata that evolve according to a linear interaction rule with site values restricted to a finite field.