Advertisement

On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata

  • Joonatan Jalonen
  • Jarkko Kari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10875)

Abstract

We prove that surjective ultimately right-expansive cellular automata over full shifts are chain-transitive. This immediately implies Boyle’s result that expansive cellular automata are chain-transitive. This means that the chain-recurrence assumption can be dropped from Nasu’s result that surjective ultimately right-expansive cellular automata with right-sided neighborhoods have the pseudo-orbit tracing property, which also implies that the (canonical) trace subshift is sofic. We also provide a theorem with a simple proof that comprises many known results including aforementioned result by Nasu. Lastly we show that there exists a right-expansive reversible cellular automaton that has a non-sofic trace and thus does not have the pseudo-orbit tracing property. In this paper we only consider cellular automata over full shifts, while both Nasu and Boyle obtain their results over more general shift spaces.

References

  1. 1.
    Boyle, M.: Some sofic shifts cannot commute with nonwandering shifts of finite type. Ill. J. Math. 48(4), 1267–1277 (2004)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Boyle, M., Maass, A.: Expansive invertible onesided cellular automata. J. Math. Soc. Jpn. 52, 725–740 (2000)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Boyle, M., Maass, A.: Erratum to: [2]Google Scholar
  4. 4.
    Blanchard, F., Maass, A.: Dynamical properties of expansive one-sided cellular automata. Israel J. Math. 99, 149–174 (1997)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Grünbaum, B., Shephard, G.C.: Tilings and Patterns. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1989)zbMATHGoogle Scholar
  6. 6.
    Jalonen, J., Kari, J.: Conjugacy of one-dimensional one-sided cellular automata is undecidable. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 227–238. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-73117-9_16CrossRefGoogle Scholar
  7. 7.
    Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21, 571–586 (1992)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Kari, J.: Rice’s theorem for the limit sets of cellular automata. Theoret. Comput. Sci. 127(2), 229–254 (1994)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kari, J., Lukkarila, V.: Some undecidable dynamical properties for one-dimensional reversible cellular automata. In: Condon, A., Harel, D., Kok, J., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses. Natural Computing Series, pp. 639–660. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-540-88869-7_32CrossRefGoogle Scholar
  10. 10.
    Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergod. Theory Dyn. Syst. 17, 417–433 (1997)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kůrka, P.: Topological dynamics of one-dimensional cellular automata. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Sciences, Part 20, pp. 9246–9268. Springer, New York (2009). ISBN 978-0-387-75888-6CrossRefGoogle Scholar
  12. 12.
    Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). ISBN 0-521-55124-2Google Scholar
  13. 13.
    Lukkarila, V.: The 4-way deterministic tiling problem is undecidable. Theoret. Comput. Sci. 410, 1516–1533 (2009)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Maruoka, A., Kimura, M.: Condition for injectivity of global maps for tessellation automata. Inform. Control 32(2), 158–162 (1976)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Nasu, M.: Textile Systems for Endomorphisms and Automorphisms of the Shift. Memoirs of the American Mathematical Society, vol. 546. American Mathematical Society, Providence (1995)zbMATHGoogle Scholar
  16. 16.
    Nasu, M.: The dynamics of expansive invertible onesided cellular automata. Trans. Am. Math. Soc. 354(10), 4067–4084 (2002)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Nasu, M.: Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. Ergod. Theory Dyn. Syst. 28(1), 167–209 (2008)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Taati, S.: Cellular automata reversible over limit set. J. Cell. Autom. 2, 167–177 (2007)MathSciNetzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  1. 1.University of TurkuTurkuFinland

Personalised recommendations