DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
From MaRDI portal
Publication:2841990
DOI10.1142/S0129054113500032zbMath1286.68279arXiv1204.5393OpenAlexW2963927623MaRDI QIDQ2841990
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.5393
Related Items
On almost periodicity of morphic sequences, Effective S-adic Symbolic Dynamical Systems, Self-induced systems, A simple approach to minimal substitution subshifts, Bracket words: A generalisation of Sturmian words arising from generalised polynomials, Decidable problems in substitution shifts, Morphic words and equidistributed sequences, Iterative algebras.
Cites Work
- Cobham's theorem for substitutions
- On the simplification of infinite morphic words
- Matching rules and substitution tilings
- Morphisms and almost-periodicity
- Descendants of primitive substitutions
- \(K\)-groups associated with substitution minimal systems
- On the subword equivalence problem for morphic words
- A characterization of substitutive sequences using return words
- An extension of Lagrange's theorem to interval exchange transformations over quadratic fields
- On the factors of automatic words
- Almost periodic sequences.
- More on morphisms and almost-periodicity
- Tilings, substitution systems and dynamical systems generated by them
- Syndeticity and independent substitutions
- Substitution dynamical systems: characterization of linear repetitivity and applications
- Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
- A characterization of the Morse minimal set up to topological conjugacy
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- On the periodicity of morphisms on free monoids
- The ω sequence problem for DOL systems is decidable
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Decidability of periodicity for infinite words
