discrete dynamical system that is composed of an array of cells, each of which behaves like a finite-state automaton. All interactions are local, with the next state of a cell being a function of the current state of itself and its neighbors. Conway's Game of Life is a CA.

a bit like Conway's Game of Life (which you might have heard about)

a discrete dynamic system composed of a set of cells in a one dimensional or multi dimensional lattice

a finite automaton that takes, as its inputs, the current state of other identically programmed automata

a group of cells that evolves only by nearest neighbor interaction

a lattice composed of a tessellated shape(s) for which a transition function is assigned that affects a site based on the configuration of a specified, localized neighborhood

a lattice of finite automata that all obey transition functions defined by the local context of each cell at any given time

a mathematical model in which complex patterns can evolve out of repeated application of very simple rules

a mathematical object that consists of (usually) an infinite regular grid of cells, each of which may be in a finite number of states and a set of transition rules, according to which the cells change their states simultaneously in discrete time steps

an approach that explores how simple rules of local patch processes can generate complex landscape behaviors in space and time

an array of cells, each of which can have any one of a finite number of states

an array of identically programmed automata, or "cells", which interact with one another

an array of many simple processors arranged in a lattice

a one-dimensional "world," shown as a row of colored squares

a regular lattice of cells with local state, which interact with their neighbors subject to a uniform rule which governs all cells

a regular, n-dimensional grid composed of simple, identical, spatially interacting cells

a simple computation al mechanism that, for example, changes the color of each cell on a grid based on the color of adjacent (or nearby) cells according to a transformation rule

a type of computer program which models a region of programmable "cells" whose behavior is dependent on the states of neighboring cells

a very specific kind of simple program which has as you say a grid or an array of cells like the arrangements of atoms in a regular crystal or some such other thing

A mathematical model consisting of a set of simple interconnected elements (known as Cells) that synchronously change state depending on a set of rules. The set of valid States is fixed. The rules (usually the same for all Cells in the automaton) specify the next State that a given Cell will enter depending on its current State and that of the Cells in its Neighborhood.

(CA) A discrete dynamical system that is composed of an array of cells, each of which behaves like a finite-state automaton.

A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology. It consists of an infinite, regular grid of cells, each in one of a finite number of states. The grid can be in any finite number of dimensions.