Abstract
This tutorial surveys computational aspects of cellular automata, a discrete dynamical model introduced by S. Ulam and J. von Neumann in the late 40s: a regular grid of finite state cells evolving synchronously according to a common local rule described by a finite automaton.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Delorme, M.: An introduction to cellular automata: some basic definitions and concepts. In: Delorme, M., Mazoyer, J. (eds.) Cellular Automata, Saissac, pp. 5–49. Kluwer Acad. Publ., Dordrecht (1999)
Kari, J.: Theory of cellular automata: A survey. Theoretical Computer Science 334, 3–33 (2005)
Rozenberg, G., Baeck, T., Kok, J. (eds.): Handbook of Natural Computing. Springer, Berlin (2011, to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ollinger, N. (2011). Tutorial on Cellular Automata. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21341-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21340-3
Online ISBN: 978-3-642-21341-0
eBook Packages: Computer ScienceComputer Science (R0)