JCA HomeIssue Contents

The Evolution of Finite 1-Dimensional Cellular Automata Updated with k-Rules
Joseph Seaborn III, Aaron Churchill, Philip Mummert and Michael Bardzell

Finite cellular automata generated over cyclic groups are studied. By treating these systems as algebraic structures, properties of the corresponding state transition diagrams are deduced from the kernels of the evolution endomorphisms. Results on Rule 90 CA with 2n cells which die out over time are generalized to systems with 2-rule updates. In the case of adjacent k-rules, a necessary and sufficient condition for reversibility is given as well as a sufficient condition for these automata to die.

Keywords: Group alphabets, Reversible CA, k-rules, Linear CA

Full Text (IP)