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.
Computational aspects of asynchronous cellular automata / Chandesris, Jerome.; Dennunzio, Alberto; Formenti, Enrico; Manzoni, Luca. - STAMPA. - 6795:(2011), pp. 466-468. ( 15th International Conference on Developments in Language Theory, DLT 2011 Milan, ita 2011) [10.1007/978-3-642-22321-1_41].
Computational aspects of asynchronous cellular automata
Manzoni Luca
2011-01-01
Abstract
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.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
