An introduction to cellular automata

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageEnglish
Title of host publicationBio-Inspired Computing Machines
Subtitle of host publicationToward Novel Computational Architectures
EditorsM. Tomassini , D. Mange
Place of PublicationLausanne, Switzerland
PublisherPresses Polytechniques et Universitaires Romandes
Pages49-58
StatePublished - 1998

Fingerprint

Dive into the research topics of 'An introduction to cellular automata'. Together they form a unique fingerprint.

Cite this