Decidability of uniform recurrence of morphic sequences
From MaRDI portal
Abstract: We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.
Recommendations
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Decidability, arithmetic subsequences and eigenvalues of morphic subshifts
- Decidability and \(k\)-regular sequences
- Complexité de suites engendrées par des récurrences unipotentes
- Undecidability of restricted uniform recurrence equations
- Recognizability for sequences of morphisms
- scientific article; zbMATH DE number 2087233
- On the complexity function for sequences which are not uniformly recurrent
- On factor complexity of morphic sequences
- scientific article; zbMATH DE number 4173065
Cites work
- K-groups associated with substitution minimal systems
- A characterization of substitutive sequences using return words
- A characterization of the Morse minimal set up to topological conjugacy
- Almost periodic sequences.
- An extension of Lagrange's theorem to interval exchange transformations over quadratic fields
- Cobham's theorem for substitutions
- Decidability of periodicity for infinite words
- Descendants of primitive substitutions
- Matching rules and substitution tilings
- More on morphisms and almost-periodicity
- Morphisms and almost-periodicity
- On the factors of automatic words
- On the periodicity of morphisms on free monoids
- On the simplification of infinite morphic words
- On the subword equivalence problem for morphic words
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
- Substitution dynamical systems: characterization of linear repetitivity and applications
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Syndeticity and independent substitutions
- The ω sequence problem for DOL systems is decidable
- Tilings, substitution systems and dynamical systems generated by them
Cited in
(16)- Self-induced systems
- Morphic words and equidistributed sequences
- Decidability, arithmetic subsequences and eigenvalues of morphic subshifts
- A simple approach to minimal substitution subshifts
- On almost periodicity of morphic sequences
- Effective S-adic symbolic dynamical systems
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Recognizability for sequences of morphisms
- On uniform recurrence of a direct product
- Iterative algebras.
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Decidable problems in substitution shifts
- A note on the base-p expansions of putative counterexamples to the p-adic Littlewood conjecture
- Stability properties for subgroups generated by return words
- \(\mathcal{S}\)-adic characterization of minimal dendric shifts
- Well-quasi-orderings on word languages
This page was built for publication: Decidability of uniform recurrence of morphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841990)
