Abstract
Cellular automata (CA) were originally conceived by Ulam and von Neumann in the 1940s to provide a formal framework for investigating the behavior of complex, extended systems [32]. CAs are dynamical systems in which space and time are discrete. A cellular automaton consists of an array of cells, each of which can be in one of a finite number of possible states, updated synchronously in discrete time steps, according to a local, identical interaction rule. The state of a cell at the next time step is determined by the current states of a surrounding neighborhood of cells [20, 29, 33].
| Original language | English GB |
|---|---|
| Title of host publication | Bio-Inspired Computing Machines |
| Subtitle of host publication | Toward Novel Computational Architectures |
| Editors | M. Tomassini , D. Mange |
| Place of Publication | Lausanne, Switzerland |
| Publisher | Presses Polytechniques et Universitaires Romandes |
| Pages | 269-287 |
| State | Published - 1998 |