Computational Aspects of Asynchronous Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Computational Aspects of Asynchronous Cellular Automata

Résumé

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.

Dates et versions

hal-01311356 , version 1 (04-05-2016)

Identifiants

Citer

Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni. Computational Aspects of Asynchronous Cellular Automata. Developments in Language Theory 2011, Giancarlo Mauri; Alberto Leporati, Jul 2011, Milan, Italy. pp.466-468, ⟨10.1007/978-3-642-22321-1_41⟩. ⟨hal-01311356⟩
54 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More