Coding of substitution dynamical systems as shifts of finite type
From MaRDI portal
Publication:2805069
Recommendations
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Decidability of periodicity for infinite words
- Directed graphs and substitutions
- Geometric representation of substitutions of Pisot type
- On the periodicity of morphisms on free monoids
- Power of words and recognizability of fixpoints of a substitution
- Prefix-suffix automaton associated with a primitive substitution
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Substitution dynamical systems. Spectral analysis
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Substitutions in dynamics, arithmetics and combinatorics
- K-groups associated with substitution minimal systems
Cited in
(7)- Denjoy systems and substitutions
- Substitution dynamical systems on infinite alphabets
- Substitutions, coding prescriptions and integer representation
- Substitution systems associated with the dynamical system \((\mathcal{A},T_f)\)
- Substitutive number systems
- Coding Subset Shift by Subgroup Conjugacy
- Prefix-suffix automaton associated with a primitive substitution
This page was built for publication: Coding of substitution dynamical systems as shifts of finite type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805069)