Skip to main content

Shifting and Lifting of Cellular Automata

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

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

Included in the following conference series:

Abstract

We consider the family of all the Cellular Automata (CA) sharing the same local rule but have different memory. This family contains also all the CA with memory m ≤ 0 (one-sided CA) which can act both on A and on A . We study several set theoretical and topological properties for these classes. In particular we investigate if the properties of a given CA are preserved when we consider the CA obtained by changing the memory of the original one (shifting operation). Furthermore we focus our attention to the one-sided CA acting on A starting from the one-sided CA acting on A and having the same local rule (lifting operation). As a particular consequence of these investigations, we prove that the long-standing conjecture [Surjectivity \(\Rightarrow\) Density of the Periodic Orbits (DPO)] is equivalent to the conjecture [Topological Mixing \(\Rightarrow\) DPO].

This work has been supported by the Interlink/MIUR project “Cellular Automata: Topological Properties, Chaos and Associated Formal Languages”, by the ANR Blanc “Projet Sycomore” and by the PRIN/MIUR project “Formal Languages and Automata: Mathematical and Applicative Aspects”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Blanchard, F.: Dense periodic points in cellular automata, http://www.math.iupui.edu/~mmisiure/open/

  2. Blanchard, F., Maass, A.: Dynamical behavior of Coven’s aperiodic cellular automata. Theoretical Computer Science 163, 291–302 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blanchard, F., Maass, A.: Dynamical properties of expansive one-sided cellular automata. Israel Journal of Mathematics 99, 149–174 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blanchard, F., Tisseur, P.: Some properties of cellular automata with equicontinuity points. Ann. Inst. Henri Poincaré, Probabilité et Statistiques 36, 569–582 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boyle, M., Fiebig, D., Fiebig, U.: A dimension group for local homeomorphisms and endomorphisms of onesided shifts of finite type. Journal für die Reine und Angewandte Mathematik 487, 27–59 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Boyle, M., Kitchens, B.: Periodic points for cellular automata. Indag. Math. 10, 483–493 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cattaneo, G., Finelli, M., Margara, L.: Investigating topological chaos by elementary cellular automata dynamics. Theoretical Computer Science 244, 219–241 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Codenotti, B., Margara, L.: Transitive cellular automata are sensitive. American Mathematical Monthly 103, 58–62 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Devaney, R.L.: An introduction to chaotic dynamical systems, 2nd edn. Addison-Wesley, London (1989)

    MATH  Google Scholar 

  10. Hedlund, G.A.: Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory 3, 320–375 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergod. Th. & Dynam. Sys. 17, 417–433 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kůrka, P.: Topological symbolic dynamics, Volume 11 of Cours Spécialisés, Société Mathématique de France (2004)

    Google Scholar 

  13. Sablik, M.: Directional dynamics for cellular automata. a sensitivity to the initial conditions approach. Preprint (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Acerbi, L., Dennunzio, A., Formenti, E. (2007). Shifting and Lifting of Cellular Automata. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73001-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73000-2

  • Online ISBN: 978-3-540-73001-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics