Published July 19, 2011 | Version v1
Conference paper

Computational Aspects of Asynchronous Cellular Automata

Description

Cellular Automata (CA) are a computational model widely used in many scientific fields. A CA consists of identical finite automata arranged over a regular lattice (i.e. every configuration of a CA is an element of A ℤ where A is a finite set of local states). Each automaton updates its state on the basis of its own state and the one of its neighbors according to a local rule. All updates are synchronous.

Abstract

International audience

Additional details

Identifiers

URL
https://hal.science/hal-01311356
URN
urn:oai:HAL:hal-01311356v1