We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
Despite the recognition of cellular automata (CA) as a exible and powerful tool for urban growth simulation, the calibration of CA had been largely heuristic until recent eVorts to...
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...