Computational Aspects of Asynchronous Cellular Automata

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.
Type de document :
Communication dans un congrès
Developments in Language Theory 2011, Jul 2011, Milan, Italy. Springer, 6795, pp.466-468, 2011, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-642-22321-1_41>. <10.1007/978-3-642-22321-1_41>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01311356
Contributeur : Enrico Formenti <>
Soumis le : mercredi 4 mai 2016 - 10:49:11
Dernière modification le : mercredi 11 mai 2016 - 01:49:39

Identifiants

Collections

Citation

Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni. Computational Aspects of Asynchronous Cellular Automata. Developments in Language Theory 2011, Jul 2011, Milan, Italy. Springer, 6795, pp.466-468, 2011, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-642-22321-1_41>. <10.1007/978-3-642-22321-1_41>. <hal-01311356>

Partager

Métriques

Consultations de la notice

35