Transitive action on finite points of a full shift and a finitary Ryan’s theorem

DOI10.1017/etds.2017.84zbMath1410.37020arXiv1610.05487OpenAlexW2963923458MaRDI QIDQ5376550

Jarkko Peltomäki

Publication date: 13 May 2019

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.05487

zbMATH Keywords

Turing machinesRyan's theoremfour-symbol full shiftmixing subshifts of finite type

Mathematics Subject Classification ID

Related Items (5)

Generating infinite monoids of cellular automata ⋮ Glider automata on all transitive sofic shifts ⋮ Glider automorphisms on some shifts of finite type and a finitary Ryan's theorem ⋮ Universal groups of cellular automata ⋮ Glider automorphisms and a finitary Ryan's theorem for transitive subshifts of finite type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphisms of Sturmian systems and the discrete chair substitution tiling system
• Random subshifts of finite type
• Universal pattern generation by cellular automata
• Introductory notes on Richard Thompson's groups
• Towards an algebraic theory of Boolean circuits.
• The mapping class group of a shift of finite type
• Some sofic shifts cannot commute with nonwandering shifts of finite type
• Theory of cellular automata: a survey
• An introduction to right-angled Artin groups.
• The automorphism group of a shift of subquadratic growth
• On automorphism groups of low complexity subshifts
• Toeplitz subshift whose automorphism group is not finitely generated
• The Group of Reversible Turing Machines
• Strongly Universal Reversible Gate Sets
• The entropies of topological Markov shifts and a related class of algebraic integers
• SOME REMARKS ON TOPOLOGICAL FULL GROUPS OF CANTOR MINIMAL SYSTEMS
• Cellular Automata and Groups
• Periodicity and Immortality in Reversible Computing
• Infinite-to-One Codes and Markov Measures
• Homomorphismes entre systèmes dynamiques définis par substitutions
• The Automorphism Group of a Shift of Finite Type
• Homoclinic points of algebraic $\mathbb {Z}^d$-actions
• Characterization of inert actions on periodic points. Part I
• Characterization of inert actions on periodic points. Part II
• Textile systems for endomorphisms and automorphisms of the shift
• An Introduction to Symbolic Dynamics and Coding
• Representation of reversible cellular automata with block permutations
• Flow equivalence of G-SFTs
• Textile systems and one-sided resolving automorphisms and endomorphisms of the shift
• Endomorphisms and automorphisms of the shift dynamical system
• The shift and commutativity
• Normal amenable subgroups of the automorphism group of the full shift

This page was built for publication: Transitive action on finite points of a full shift and a finitary Ryan’s theorem