Department of Mathematics, Stevens Institute of Technology, Hoboken, NJ 07030, USA and School of Mathematics, Institute for Advanced Study, Princeton NJ 08540, USA
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
This paper discusses a division of one-dimensional cellular automata into classes which seem to correspond to different types of behaviour.
[1]Adler, R. L. & Marcus, B.. Topological Entropy and Equivalence of Dynamical Systems. Mem. Amer. Math. Soc.20 (# 219), 1979.Google Scholar
[2]
[2]Riccia, G. Delia. Equicontinuous semi-flows (one-parameter semi-groups) on locally compact or complete metric spaces. Math. Systems Theory4 (1970), 29–34.CrossRefGoogle Scholar
[3]
[3]Farmer, D., Toffoli, T. & Wolfram, S. eds. Cellular Automata. North-Holland Pub. Co., Amsterdam1984.Google Scholar
[4]
[4]Feller, W.. An Introduction to Probability Theory and its Applications, Vol. 1, first edition. J. Wiley, New York, 1950.Google Scholar
[5]
[5]Furstenberg, H.. Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton Univ. Press, Princeton, 1981.CrossRefGoogle Scholar
[6]
[6]Grassberger, P.. Chaos and diffusion in deterministic cellular automata. Physica10D (1984), 52–58 (reprinted in [3]).Google Scholar
[7]
[7]Hedlund, G. A.. Endomorphisms and automorphisms of the shift in dynamical systems. Math. Systems Theory3 (1969), 320–375.CrossRefGoogle Scholar
[8]
[8]Walters, P.. An Introduction to Ergodic Theory. Springer Verlag, New York, 1982.CrossRefGoogle Scholar
[9]
[9]Wolfram, S.. Universality and complexity in cellular automata. Physica10D (1984), 1–35 (reprinted in [3]).Google Scholar
[10]
[10]Wolfram, S.. Computation theory of cellular automata. Comm. Math. Phys.96 (1984), 15–57.CrossRefGoogle Scholar