Strict Asymptotic Nilpotency in Cellular Automata

  • Ville SaloEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10248)


We discuss the problem of which subshifts support strictly asymptotically nilpotent CA, that is, asymptotically nilpotent CA which are not nilpotent. The author talked about this problem in AUTOMATA and JAC 2012, and this paper discusses the (lack of) progress since. While the problem was already solved in 2012 on a large class of multidimensional SFTs, the full solutions are not known for one-dimensional sofics, multidimensional SFTs, and full shifts on general groups. We believe all of these questions are interesting in their own way, and discuss them in some detail, along with some context.



We thank Pierre Guillon and Ilkka Törmä for their comments on the draft.


  1. 1.
    Aanderaa, S.O., Lewis, H.R.: Linear sampling, the \(\forall \exists \forall \) case of the decision problem. J. Symbolic Logic 39, 519–548 (1974)Google Scholar
  2. 2.
    Boyle, M., Pavlov, R., Schraudner, M.: Multidimensional sofic shifts without separation and their factors. Trans. Am. Math. Soc. 362(9), 4617–4653 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3), 731–764 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Gács, P., Kurdyumov, G.L., Levin, L.A.: One-dimensional uniform arrays that wash out finite islands. Problemy Peredachi Informatsii 14(3), 92–96 (1978)Google Scholar
  5. 5.
    Guillon, P., Richard, G.: Asymptotic behavior of dynamical systems and cellular automata. ArXiv e-prints, April 2010Google Scholar
  6. 6.
    Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571–586 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Lind, D.A.: Applications of ergodic theory and sofic systems to cellular automata. Physica D 10(1–2), 36–44 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)CrossRefzbMATHGoogle Scholar
  9. 9.
    Miyamoto, M.: An equilibrium state for a one-dimensional life game. J. Math. Kyoto Univ. 19(3), 525–540 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Pavlov, R., Schraudner, M.: Classification of sofic projective subdynamics of multidimensional shifts of finite type. Trans. Am. Math. Soc. 367(5), 3371–3421 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Pivato, M.: The ergodic theory of cellular automata. Int. J. Gen. Syst. 41(6), 583–594 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Salo, V.: On Nilpotency and Asymptotic Nilpotency of Cellular Automata. ArXiv e-prints, May 2012Google Scholar
  13. 13.
    Salo, V.: Subshifts with sparse projective subdynamics. ArXiv e-prints, May 2016Google Scholar
  14. 14.
    Salo, V., Törmä, I.: Computational aspects of cellular automata on countable sofic shifts. In: Mathematical Foundations of Computer Science 2012, pp. 777–788 (2012)Google Scholar
  15. 15.
    Törmä, I.: A uniquely ergodic cellular automaton. J. Comput. Syst. Sci. 81(2), 415–442 (2015)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  1. 1.University of TurkuTurkuFinland

Personalised recommendations