Skip to main content
Springer Nature Link
Log in

Computational Aspects of Asynchronous Cellular Automata

  • Conference paper
Developments in Language Theory (DLT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6795))

Included in the following conference series:

  • 630 Accesses

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.

This work has been partially supported by the French National Research Agency project EMC (ANR-09-BLAN-0164).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Amar, P., Bernot, G., Norris, V.: Hsim: a simulation programme to study large assemblies of proteins. Journal of Biological Physics and Chemistry 4, 79–84 (2004)

    Article  Google Scholar 

  2. Chandesris, J., Dennunzio, A., Formenti, E., Manzoni, L.: Computational aspects of asynchronous cellular automata (2010), http://arxiv.org/find/all/1/all:+239813/0/1/0/all/0/1

  3. Chopard, B.: Modelling physical systems by cellular automata. In: Rozenberg, G., et al. (ed.) Handbook of Natural Computing: Theory, Experiments, and Applications. Springer, Heidelberg (to appear, 2011)

    Google Scholar 

  4. Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. J. Comput. Syst. Sci. 70, 201–220 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Nakamura, K.: Asynchronous cellular automata and their computational ability. Systems, Computers, Control 5, 58–66 (1974)

    MathSciNet  Google Scholar 

  6. Nehaniv, C.L.: Evolution in asynchronous cellular automata. Artificial Life VIII, 65–73 (2002)

    Google Scholar 

  7. Ollinger, N.: Universalities in cellular automata. In: Rozenberg, G., et al. (ed.) Handbook of Natural Computing: Theory, Experiments, and Applications, Springer, Heidelberg (to appear, 2011)

    Google Scholar 

  8. Regnault, D., Schabanel, N., Thierry, E.: Progresses in the analysis of stochastic 2d cellular automata: A study of asynchronous 2d minority. Theoretical Computer Science 410, 4844–4855 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51, 123–143 (1999)

    Article  Google Scholar 

  10. Worsch, T.: A note on (intrinsically?) universal asynchronous cellular automata (2010) (preprint)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Viale Sarca 336, 20126, Milano, Italy

    Luca Manzoni

  2. Laboratoire I3S, Université Nice-Sophia Antipolis, 2000 Route des Colles, 06903, Sophia Antipolis, France

    Jérôme Chandesris, Alberto Dennunzio & Enrico Formenti

Authors
  1. Jérôme Chandesris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luca Manzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-22321-1_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22321-1_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22320-4

  • Online ISBN: 978-3-642-22321-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics