Abstract
A basic Cellular Automata (CA) is a regular grid of cells (a lattice), each one having a finite number of states [10] (i.e., a finite state machine). Every cell, also denoted as cellular automaton, has a defined neighborhood to interact with. Time is discrete, and in every iteration any cell interacts with its neighborhood to find its new state depending on its own state and its neighbors’ state. CAs are simulated by a finite grid, which can be a line in one dimension, a rectangle in 2D or a cube in 3D.
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
Notes
- 1.
From Greek auto, meaning self, and poiesis, meaning creation or production, refers to a system capable of reproducing and maintaining by itself.
References
Adamatzky, A. (ed.): Game of life cellular automata, vol. 1. Springer, Berlin (2010)
Berlekamp, C, Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 2. Academic Press.(1982)
Codd, E.F.: Cellular Automata. ACM Monograph Series. Academic Press Inc., New York and London (1968)
Cook, M.: Universality in elementary cellular automata. Complex Syst. 15, 1–40 (2004)
Gardner, M.: Mathematical Games: The Fantastic Combinations of John Conway’s New Solitaire Game Life. Scientific American, (1970)
Ilachinski, A.: Cellular Automata: A Discrete Universe, World Scientific Publishing (2001)
Mitchell, M., Crutchfield, J.P., Peter T. Hraber, V.: Dynamics, Computation, and the ’edge of chaos’: A re-examination. In: Cowan, G.A., Pines, D., Meltzer, D., (eds.) Complexity: Metaphors, Models, and Reality. Santa Fe Institute Studies in the Sciences of Complexity, vol. 19 pp. 497–513. Addison-Wesley, (1994)
Rendell, P.: Collision-based computing. Turing universality of the game of life, pp. 513–539. Springer, Berlin (2002)
Sipper, M., Tomassini, M., Capcarrere, M.S.: Evolving asynchronous and scalable non-uniform cellular automata. In: Smith, G.D., Steele, N.C., Albrecht, R.F., (eds.) Proceedings of International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA97) (1997)
von Neumann, J.: The general and logical theory of automata. In: Jeffress, L.A. (ed.) Cerebral Mechanisms in Behavior The Hixon Symposium, pp. 1–31. John Wiley & Sons, New York (1951)
von Neumann, J.: The Theory of Self-reproducing Automata. University of Illinois Press, Urbana, IL (1966)
Wikimedia Commons by Richard Ling - Own work, CC BY-SA 3.0. https://commons.wikimedia.org/wiki/Conus_textile#/media/File:Textile_cone.JPG
Wolf-Gladrow, D. A.: Lattice-gas Cellular Automata And Lattice Boltzmann models: An Introduction. Springer Science & Business Media (2000)
Wolfram, S.: A New Kind of Science (2002)
Wolfram, S.: Theory and Application of Cellular Automata. World Scientific, Singapore (1986)
Zuse, K.: Rechnender Raum. Friedrich Vieweg & Sohn, Braunschweig (1969)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Burguillo, J.C. (2018). Cellular Automata. In: Self-organizing Coalitions for Managing Complexity. Emergence, Complexity and Computation, vol 29. Springer, Cham. https://doi.org/10.1007/978-3-319-69898-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-69898-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69896-0
Online ISBN: 978-3-319-69898-4
eBook Packages: EngineeringEngineering (R0)