Abstract
Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata. The complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities. The systems are usually irreversible, and are found to evolve through transients to attractors consisting of cycles sometimes containing a large number of configurations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys.55, 601 (1983)
Golomb, S.W.: Shift register sequences. San Francisco: Holden-Day 1967
Selmer, E.S.: Linear recurrence relations over finite fields. Dept. of Math., Univ. of Bergen, Norway (1966)
Miller, J.C.P.: Periodic forests of stunted trees. Philos. Trans. R. Soc. Lond. A266, 63 (1970); A293, 48 (1980)
ApSimon, H.G.: Periodic forests whose largest clearings are of size 3. Philos. Trans. R. Soc. Lond. A266, 113 (1970)
ApSimon, H.G.: Periodic forests whose largest clearings are of sizen≧4. Proc. R. Soc. Lond. A319, 399 (1970)
Sutton, C.: Forests and numbers and thinking backwards. New Sci.90, 209 (1981)
Moore, E.F.: Machine models of self-reproduction. Proc. Symp. Appl. Math.14, 17 (1962) reprinted in: Essays on cellular automata, A. W. Burks. Univ. of Illinois Press (1966)
Aggarwal, S.: Local and global Garden of Eden theorems. Michigan University technical rept. 147 (1973)
Knuth, D.: Fundamental algorithms, Reading, MA: Addison-Wesley 1968.
Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford: Oxford University Press 1968
Mac Williams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. Amsterdam: North-Holland 1977
Griffiths, P., Harris, J.: Principles of algebraic geometry. New York: Wiley 1978
Fredkin, E., Margolus, N.: Private communications
Ronse, C.: Non-linear shift registers: A survey. MBLE Research Lab. report, Brussels (May 1980)
Harao, M., Noguchi, S.: On some dynamical properties of finite cellular automaton. IEEE Trans. Comp. C-27, 42 (1978)
Grassberger, P.: A new mechanism for deterministic diffusion. Phys. Rev. A (to be published)
Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. J. Comb. Theory (A)30, 83 (1981)
Knuth, D.: Seminumerical algorithms. 2nd ed. Reading, MA: Addison-Wesley 1981
Gelfand, A.E.: On the cyclic behavior of random transformations on a finite set. Tech. rept. 305, Dept. of Statistics, Stanford Univ. (August 1981)
Odlyzko, A.M.: Unpublished
Lind, D.A.: Applications of ergodic theory and sofic systems to cellular automata. Physica D10 (to be published)
Wolfram, S.: Computation theory of cellular automata. Institute for Advanced Study preprint (January 1984)
Lenstra, H.W., Jr.: Private communication
Author information
Authors and Affiliations
Additional information
Communicated by O.E. Lanford
Address from January 1983
Rights and permissions
About this article
Cite this article
Martin, O., Odlyzko, A.M. & Wolfram, S. Algebraic properties of cellular automata. Commun.Math. Phys. 93, 219–258 (1984). https://doi.org/10.1007/BF01223745
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01223745