Computational Aspects of Asynchronous Cellular Automata
- Cite this paper as:
- Chandesris J., Dennunzio A., Formenti E., Manzoni L. (2011) Computational Aspects of Asynchronous Cellular Automata. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.