A Toolkit for Programming Cellular Automata

  • Richard J. Gaylord
  • Kazume Nishidate


The structure of a CA is extremely simple when written in the Mathematica programming language: a matrix is set up, a function (CA rule) is defined, and the function is repeatedly applied to the matrix. In this chapter we will lay the foundations for the CA programming in the chapters that follow. We first give both a physical and a computational definition of a cellular automaton. Then we discuss the operation of code fragments that repeatedly appear in CA programs throughout the book. Reading the programs in the book with an understanding of how these code fragments work will allow you to focus on the principal programming task in writing a CA program in Mathematica—defining the CA rules.


Lattice Site Cellular Automaton Left Border Cellular Automaton Model Mobile Object 
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.

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • Richard J. Gaylord
    • 1
  • Kazume Nishidate
    • 2
  1. 1.Dept. of Materials ScienceUniversity of IllinoisUrbana-Champaign, UrbanaUSA
  2. 2.Dept. of Electrical and Electronic Engineering, Faculty of EngineeringIwate UniversityMorioka 020Japan

Personalised recommendations