2011 | OriginalPaper | Buchkapitel
Computational Aspects of Asynchronous Cellular Automata
verfasst von : Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni
Erschienen in: Developments in Language Theory
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.