Skip to main content
SpringerLink
Log in

(Intrinsically?) Universal Asynchronous CA

  • Conference paper
Cellular Automata (ACRI 2012)

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

Included in the following conference series:

Abstract

We consider asynchronous one-dimensional cellular automa- ta (CA). It is shown that there is one with von Neumann neighborhood of radius 1 which can simulate each asynchronous one-dimensional cellular automaton. An analogous construction is described for α-asynchronous CA (where each cell independently enters a new state with probability α. We also point out some generalizations for other updating schemes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandini, S., Bonomi, A., Vizzari, G.: What Do We Mean by Asynchronous CA? A Reflection on Types and Effects of Asynchronicity. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 385–394. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Lee, J., Adachi, S., Peper, F., Morita, K.: Asynchronous game of life. Physica D 194(3-4), 369–384 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ollinger, N.: Universalities in cellular automata; a (short) survey. In: Durand, B. (ed.) Proceedings JAC 2008, pp. 102–118 (2008)

    Google Scholar 

  4. Worsch, T.: A note on (Intrinsically?) universal asynchronous cellular automata. In: Fatès, N., Kari, J., Worsch, T. (eds.) Proceedings Automata 2010, pp. 339–350 (2010)

    Google Scholar 

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

    Google Scholar 

  6. Golze, U.: (A-)synchronous (non-)deterministic cell spaces simulating each other. Journal of Computer and System Sciences 17(2), 176–193 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Worsch, T., Nishio, H.: Achieving universality of CA by changing the neighborhood. Journal of Cellular Automata 4(3), 237–246 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking II: Classifications of cellular automata. Theoretical Computer Science 412(30), 3881–3905 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology, Germany

    Thomas Worsch

Authors
  1. Thomas Worsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Worsch, T. (2012). (Intrinsically?) Universal Asynchronous CA. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation