%0 Conference Proceedings
%T Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan’s Theorem
%+ University of Turku
%A Kopra, Johan
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Ghent, Belgium
%Y Jan M. Baetens
%Y Martin Kutrib
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10875
%P 88-99
%8 2018-06-20
%D 2018
%R 10.1007/978-3-319-92675-9_7
%K Mixing SFTs
%K Automorphisms
%K Cellular automata
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01824877/document
%2 https://inria.hal.science/hal-01824877/file/469010_1_En_7_Chapter.pdf
%L hal-01824877
%U https://inria.hal.science/hal-01824877
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-10875