Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan’s Theorem

  • Johan KopraEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10875)


For any mixing SFT X containing a fixed point we construct a reversible shift-commuting continuous map (automorphism) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing directions. As an application we show that the automorphism group \({{\mathrm{Aut}}}(X)\) contains a two-element subset S whose centralizer consists only of shift maps.


Mixing SFTs Automorphisms Cellular automata 



The author thanks Ville Salo for helpful discussions concerning these topics.


  1. 1.
    Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)CrossRefGoogle Scholar
  2. 2.
    Patrick Ryan, J.: The shift and commutativity. Math. Syst. Theory 6(1–2), 82–85 (1972)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Salo, V.: Transitive action on finite points of a full shift and a finitary Ryan’s theorem. arXiv:1610.05487v2 (2017)
  4. 4.
    Salo, V., Törmä, I.: A one-dimensional physically universal cellular automaton. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 375–386. Springer, Cham (2017). Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  1. 1.Department of Mathematics and StatisticsUniversity of TurkuTurkuFinland

Personalised recommendations