Cellular automata

  • Jeffrey R. Sampson
Part of the Texts and Monographs in Computer Science book series (MCS)


In this chapter we focus on a relatively new and currently quite active branch of automata theory. The study of cellular automata is concerned with the behavior of systems composed of regular arrays of identical interacting components. Theoretical questions of importance in cellular automata research relate to the computational powers of such machines. Thus we might want to know how many components, how many states per component, and what sorts of interconnections among components are required to simulate the behavior of a UTM. Some of the important applications of cellular automata are in the design of parallel computers, the modelling of natural cellular systems, and the solution of systems of equations.


Cellular Automaton Turing Machine Quiescent State Finite Automaton Cell Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Arbib, Michael A. Theories of Abstract Automata. Prentice-Hall, 1969.MATHGoogle Scholar
  2. Burks, Arthur W. (ed). Essays on Cellular Automata. University of Illinois Press, 1970.MATHGoogle Scholar
  3. Codd, Edgar F. Cellular Automata. Academic Press, 1968.MATHGoogle Scholar
  4. Gardner, Martin. “Mathematical games.” Scientific American. October, 1970, pp. 120–123.Google Scholar
  5. von Neumann, John. Theory of Self-Reproducing Automata. Edited and completed by Arthur W. Burks. University of Illinois Press, 1966.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1976

Authors and Affiliations

  • Jeffrey R. Sampson
    • 1
  1. 1.Department of Computing ScienceThe University of AlbertaEdmontonCanada

Personalised recommendations