Exact results for deterministic cellular automata with additive rules
- 53 Downloads
Deterministic cellular automata (CA) with additive rules are studied by exploiting the properties of circulant matrices on finite fields. Complete state transition diagrams for higher-order and multidimensional CA on finite lattices are analyzed. Conditions on the rules which make them reversible are obtained. It is shown that all state transition diagrams of the CA have identical trees rooted on cycles. General formulae for cycle lengths and multiplicities are given.
Key wordsCellular automata discrete dynamical systems
Unable to display preview. Download preview PDF.
- 1.S. Wolfram,Rev. Mod. Phys. 55:601 (1983);Physica 10D:247 (1984).Google Scholar
- 2.O. Martin, A. M. Odlyzko, and S. Wolfram,Commun. Math. Phys. 93:219 (1984).Google Scholar
- 3.Philip J. Davis,Circulant Matrices (John Wiley & Sons, New York, 1979).Google Scholar
- 4.F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes (North-Holland, New York, 1977).Google Scholar