Skip to main content
SpringerLink
Log in

A Characterization of Cellular Automata Generated by Idempotents on the Full Shift

  • Conference paper
Computer Science – Theory and Applications (CSR 2012)

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

Included in the following conference series:

  • 508 Accesses

Abstract

In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G 2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA which are not easy to directly decompose into a product of idempotents, but which are trivially seen to satisfy the conditions of the characterization. Our proof uses ideas similar to those used in the well-known Embedding Theorem and Lower Entropy Factor Theorem in symbolic dynamics. We also consider some natural decidability questions for the class of products of idempotent CA.

Research supported by the Academy of Finland Grant 131558

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. Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. Journal of Computer and System Sciences 6(5), 448–464 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  2. Boyle, M.: Lower entropy factors of sofic systems. Ergodic Theory Dynam. Systems 3(4), 541–557 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boyle, M., Lind, D., Rudolph, D.: The automorphism group of a shift of finite type. Trans. Amer. Math. Soc. 306(1), 71–114 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hurd, L.P., Kari, J., Culik, K.: he topological entropy of cellular automata is uncomputable. Ergodic Theory Dynam. Systems 12(2), 255–265 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571–586 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334, 3–33 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  8. Maass, R.: On the sofic limit sets of cellular automata. Ergodic Theory and Dynamical Systems 15 (1995)

    Google Scholar 

  9. Moore, E.F.: Machine models of self-reproduction. In: Proc. Symp. Applied Mathematics, vol. 14, p. 187–203 (1962)

    Google Scholar 

  10. Myhill, J.: The converse of moore’s garden-of-eden theorem. Proceedings of the American Mathematical Society 14, 685–686 (1963)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Turku, Finland

    Ville Salo

Authors
  1. Ville Salo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 191023, St. Petersburg, Russia

    Edward A. Hirsch

  2. University of Turku, 20014, Turku, Finland

    Juhani Karhumäki  & Arto Lepistö  & 

  3. Lobachevky State University of Nizhni Novgorod, 603950, Niszhi Novgorod, Russia

    Michail Prilutskii

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salo, V. (2012). A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30642-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation