Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-24T13:33:42.609Z Has data issue: false hasContentIssue false
  • English
  • Français

Classes of linear automata

Published online by Cambridge University Press:  19 September 2008

Robert H. Gilman
Robert H. Gilman
Affiliation:
Department of Mathematics, Stevens Institute of Technology, Hoboken, NJ 07030, USA and School of Mathematics, Institute for Advanced Study, Princeton NJ 08540, USA
Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 7 , Issue 1 , March 1987 , pp. 105 - 118
Copyright
Copyright © Cambridge University Press 1987

References

REFERENCES

[1]Adler, R. L. & Marcus, B.. Topological Entropy and Equivalence of Dynamical Systems. Mem. Amer. Math. Soc. 20 (# 219), 1979.Google Scholar
[2]Riccia, G. Delia. Equicontinuous semi-flows (one-parameter semi-groups) on locally compact or complete metric spaces. Math. Systems Theory 4 (1970), 29–34.CrossRefGoogle Scholar
[3]Farmer, D., Toffoli, T. & Wolfram, S. eds. Cellular Automata. North-Holland Pub. Co., Amsterdam 1984.Google Scholar
[4]Feller, W.. An Introduction to Probability Theory and its Applications, Vol. 1, first edition. J. Wiley, New York, 1950.Google Scholar
[5]Furstenberg, H.. Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton Univ. Press, Princeton, 1981.CrossRefGoogle Scholar
[6]Grassberger, P.. Chaos and diffusion in deterministic cellular automata. Physica 10D (1984), 52–58 (reprinted in [3]).Google Scholar
[7]Hedlund, G. A.. Endomorphisms and automorphisms of the shift in dynamical systems. Math. Systems Theory 3 (1969), 320–375.CrossRefGoogle Scholar
[8]Walters, P.. An Introduction to Ergodic Theory. Springer Verlag, New York, 1982.CrossRefGoogle Scholar
[9]Wolfram, S.. Universality and complexity in cellular automata. Physica 10D (1984), 1–35 (reprinted in [3]).Google Scholar
[10]Wolfram, S.. Computation theory of cellular automata. Comm. Math. Phys. 96 (1984), 15–57.CrossRefGoogle Scholar