Tutorial on Cellular Automata

  • Nicolas Ollinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6714)


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.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Kari, J.: Theory of cellular automata: A survey. Theoretical Computer Science 334, 3–33 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Rozenberg, G., Baeck, T., Kok, J. (eds.): Handbook of Natural Computing. Springer, Berlin (2011, to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Nicolas Ollinger
    • 1
  1. 1.Laboratoire d’informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRSMarseilleFrance

Personalised recommendations