Computational Aspects of Asynchronous Cellular Automata

  • Jérôme Chandesris
  • Alberto Dennunzio
  • Enrico Formenti
  • Luca Manzoni
Conference paper

DOI: 10.1007/978-3-642-22321-1_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Chandesris J., Dennunzio A., Formenti E., Manzoni L. (2011) Computational Aspects of Asynchronous Cellular Automata. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jérôme Chandesris
    • 2
  • Alberto Dennunzio
    • 2
  • Enrico Formenti
    • 2
  • Luca Manzoni
    • 1
  1. 1.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi di Milano–BicoccaMilanoItaly
  2. 2.Laboratoire I3SUniversité Nice-Sophia AntipolisSophia AntipolisFrance

Personalised recommendations