Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2009: Developments in Language Theory pp 195–206Cite as

Asymptotic Cellular Complexity

  • Conference paper

  • 548 Accesses

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

Abstract

We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal Kolmogorov complexity. This cellular automaton hence exhibits the most complex possible asymptotic behavior.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allauzen, C., Durand, B.: Tiling Problems. In: The classical decision problem. Perspectives in Mathematical Logic. Springer, Heidelberg (2001)

    Google Scholar 

  2. Cattaneo, G., Dennunzio, A., Margara, L.: Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata. Fundamenta Informaticae 52(1-3), 39–80 (2002)

    MathSciNet  MATH  Google Scholar 

  3. Cervelle, J.: Complexité dynamique et algorithmique des automates cellulaires. Habilitation à diriger des recherches, Université Paris Est, Marne-la-Vallée (December 2007)

    Google Scholar 

  4. Culik II, K., Pachl, J.K., Yu, S.: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4), 831–842 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Durand, B., Levin, L.A., Shen, A.: Complex tilings. Journal of Symbolic Logic 73(2), 593–613 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Johnson, A., Madden, K.: Putting the Pieces Together: Understanding Robinson’s Nonperiodic Tilings. The College Mathematics Journal 28(3), 172–181 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kari, J., Papasoglu, P.: Deterministic Aperiodic Tile Sets. Geometric And Functional Analysis 9, 353–369 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kurka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory & Dynamical Systems 17, 417–433 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Levin, L.A.: Aperiodic Tilings: Breaking Translational Symmetry. Comput. J. 48(6), 642–645 (2005)

    Article  Google Scholar 

  10. Robinson, R.M.: Undecidability and Nonperiodicity for Tilings of the Plane. Inventiones Math 12 (1971)

    Google Scholar 

  11. Rumyantsev, A.Y., Ushakov, M.A.: Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 396–407. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, France

    Bruno Durand & Victor Poupet

Authors
  1. Bruno Durand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Poupet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Formale Methoden der Informatik, FMI, Universität Stuttgart, Universitätsstrasse 38, 70569, Stuttgart, Germany

    Volker Diekert  & Dirk Nowotka  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Durand, B., Poupet, V. (2009). Asymptotic Cellular Complexity. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02737-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02736-9

  • Online ISBN: 978-3-642-02737-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation