Endomorphisms and automorphisms of the shift dynamical system

1969/12/01 by Gustav A. Hedlund, G. A. Hedlund · 47 citations
Computer Science · Mathematics · Physics and Astronomy · #Cellular Automata and Applications #Mathematical Dynamics and Fractals #Quantum chaos and dynamical systems

paper · doi:10.1007/bf01691062

crossref issued 1969/12/01 · crossref published 1969/12/01 · crossref published-print 1969/12/01 · openalex publication_date 1969/12/01 · crossref created 2005/05/14 · crossref deposited 2020/04/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28 · crossref indexed 2026/08/01

Citations

• Symbolic Dynamics II. Sturmian Trajectories
• Symbolic Dynamics

Cited by

• A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
• Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
• On surjectivity and dynamical properties of dill maps
• Complex wave functions, CPT and quantum field theory for classical generalized Ising models
• Interacting Geodesics on Discrete Manifolds
• Besicovitch covering numbers for \mathcal B-free and other shifts
• Formal Languages in Dynamical Systems
• Closed Image Characterizations of Locally Finite Groups via Cellular Automata
• The Curious Case of Reversible Elementary Second Order Cellular Automaton 115
• On Sloane's persistence problem
• Cellular Automata and Powers of p/q
• Decidability of monadic theories
• Intrinsic Simulations between Stochastic Cellular Automata
• Strictly Temporally Periodic Points in Cellular Automata
• Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
• On Derivatives and Subpattern Orders of Countable Subshifts
• Topological transitivity of group cellular automata is decidable
• Brief Notes and History Computing in Mexico during 50 years
• RealLife: The continuum limit of Larger than Life cellular automata
• Two-dimensional cellular automata
• Invertible cellular automata: A review
• Basic Concepts of Cellular Automata
• Some general dynamical notions
• Endomorphisms of symbolic algebraic varieties
• Rescaled entropy of cellular automata
• Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity and Reversibility
• Generically Nilpotent Cellular Automata
• Asymptoticity, automorphism groups and strong orbit equivalence
• Cellular Automata vs. Quasisturmian Shifts
• Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
• Mutually orthogonal latin squares based on cellular automata
• Characteristic measures of symbolic dynamical systems
• Normal amenable subgroups of the automorphism group of sofic shifts
• Defect particle kinematics in one-dimensional cellular automata
• On the existence of open and bi-continuing codes
• Graph and wreath products of cellular automata
• Reversible Cellular Automata
• Representation of reversible cellular automata with block permutations
• The structure of reversible one-dimensional cellular automata
• Procedures for calculating reversible one-dimensional cellular automata
• On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
• A tight linear bound on the synchronization delay of bijective automata
• Cellular automaton [wikipedia]
• Curtis–Hedlund–Lyndon theorem [wikipedia]
• Garden of Eden (cellular automaton) [wikipedia]
• Reversible cellular automaton [wikipedia]
• Symbolic dynamics [wikipedia]