Decidable problems in substitution shifts
From MaRDI portal
Abstract: In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space generated by iteration, such as aperiodicity, recognizability and (under an additional assumption) irreducibility, or minimality.
Cites work
- A simple approach to minimal substitution subshifts
- An Introduction to Symbolic Dynamics and Coding
- Aperiodic substitution systems and their Bratteli diagrams
- Asymptotic properties of free monoid morphisms
- Automatic Sequences
- Beyond primitivity for one-dimensional substitution subshifts and tiling spaces
- Decidability and universality of quasiminimal subshifts
- Decidability of periodicity for infinite words
- Decidability of the HD0L ultimate periodicity problem
- Decidability of uniform recurrence of morphic sequences
- Dimension groups and dynamical systems. Substitutions, Bratteli diagrams and Cantor systems
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Hierarchie et fermeture de certaines classes de tag-systèmes
- scientific article; zbMATH DE number 3940748 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- Invariant measures for the subshifts arising from non-primitive substitutions
- Logic and p-recognizable sets of integers
- On the periodicity of morphisms on free monoids
- On the simplification of infinite morphic words
- On two-sided infinite fixed points of morphisms
- ORDERED BRATTELI DIAGRAMS, DIMENSION GROUPS AND TOPOLOGICAL DYNAMICS
- Power of words and recognizability of fixpoints of a substitution
- Recognizability for sequences of morphisms
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Some properties of substitutive words
- Some remarks about stabilizers
- Substitution dynamical systems. Spectral analysis
- Substitution dynamical systems: characterization of linear repetitivity and applications
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- The Logical Approach to Automatic Sequences
- The monadic theory of morphic infinite words and generalizations
- Unzerlegbare, nicht negative Matrizen
Cited in
(3)
This page was built for publication: Decidable problems in substitution shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126479)
