Chapter

Developments in Language Theory

Volume 6795 of the series Lecture Notes in Computer Science pp 466-468

Computational Aspects of Asynchronous Cellular Automata

  • Jérôme ChandesrisAffiliated withLaboratoire I3S, Université Nice-Sophia Antipolis
  • , Alberto DennunzioAffiliated withLaboratoire I3S, Université Nice-Sophia Antipolis
  • , Enrico FormentiAffiliated withLaboratoire I3S, Université Nice-Sophia Antipolis
  • , Luca ManzoniAffiliated withDipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca

* Final gross prices may vary according to local VAT.

Get Access

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.