ON A POLYNOMIAL REPRESENTATION OF FINITE LINEAR CELLULAR AUTOMATA
Masaya Nohmi · Bulletin of informatics and cybernetics · 1991
This paper decides the behaviour of cellular automata, including the existence of fixed points and the order of configurations, using the polynomial representation of configurations with respect to a basis derived from a series of state transition. We are mainly concerned with cellular automata with local transition rule 90 since the method described here can be used for any finite cellular automata with a little alternations [7].