cellular automaton

Also found in: Dictionary, Wikipedia.

cellular automaton

[′sel·yə·lər ȯ′täm·ə·tən]
(computer science)
A theoretical model of a parallel computer which is subject to various restrictions to make practicable the formal investigation of its computing powers.
A mathematical construction consisting of a system of entities, called cells, whose temporal evolution is governed by a collection of rules, so that its behavior over time may appear highly complex or chaotic.

cellular automaton

(algorithm, parallel)
(CA, plural "- automata") A regular spatial lattice of "cells", each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step.

Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours' states as input and outputs its own state.

The best known example is J.H. Conway's game of Life.


Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys.

cellular automaton

A state machine that consists of an array of cells, each of which can be in one of a finite number of possible states. The cells are 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. The transitions are usually specified in the form of a rule table that defines the cell's next state for each possible neighborhood configuration. The cellular array (grid) is typically from one to three dimensions. Highly parallel, locally connected and using simple elemental units, cellular automata can perform so-called cellular computing. See state machine.

The Firefly
Constructed at the Swiss Federal Institute of Technology in Lausanne by Moshe Sipper and his colleagues, the Firefly machine is an FPGA-based hardware implementation of a cellular automaton which modifies its functioning dynamically. The system is based on the cellular programming approach, in which parallel cellular machines evolve to solve computational tasks. (Image taken by Andre Badertscher; courtesy of Dr. Moshe Sipper.)
References in periodicals archive ?
Cellular automaton rules conserving the number of active sites.
However, one day more than 20 years ago, Wolfram was observing the behavior of a cellular automaton known as Rule 30 when the program created an unpredictable pattern of stunning complexity on a computer printout.
In this type of cellular automaton, a change of state occurs in only one cell at a time instead of across the board with each step.
Boolean and) operator in any of the cell is called the linear cellular automaton.
Definition 5 We say a cellular automaton [phi] : [[0 .
An n-dimensional cellular automaton is an n-dimensional tensor whose elements are in C, and which is updated on each time step according to a cellular automaton rule R, applied to every cell in parallel.
The cellular is the most basic component of the cellular automaton, its form is {0, 1} binary or {[s.
With application of the distances between moving vehicles, average vehicle speeds in individual road segments and the microscopic cellular automaton model in nonlinear dynamic system, evaluating row lengths formed at traffic lights prohibited, the relationship between traffic flow and traffic density, traffic flow and average flow rate has been determined.
The cellular automaton, CA for short, was one of Collins's pet concepts, a key piece of his metaphysics, more foundational even than the tribe.
In a typical two-dimensional cellular automaton, space is represented by a uniform grid, with each cell holding a discrete value as its state.
A cellular automaton consists of an array of cells, each of which can be in one of finite number of possible states, updated in discrete time steps, according to a local interaction set of rules.
An improved cellular automaton model for simulating fire in a spatially heterogeneous Savanna system.

Full browser ?