Advertisement
Published in:
2011 | OriginalPaper | Chapter
Computational Aspects of Asynchronous Cellular Automata
Authors : Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni
Published in: Developments in Language Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.