Morphic words and equidistributed sequences
From MaRDI portal
Publication:2283040
DOI10.1016/j.tcs.2019.11.030zbMath1450.68002arXiv1807.08321OpenAlexW2989844123MaRDI QIDQ2283040
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.08321
morphismsubstitutionThue-Morse wordunique ergodicitymorphic word\(k\)-regular sequencefrequency of factors
Combinatorics on words (68R15) Symbolic dynamics (37B10) Automata sequences (11B85) Special sequences (11K31)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Synchronizing delay for binary uniform morphisms
- Substitution dynamical systems. Spectral analysis
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- On an infinite permutation similar to the Thue-Morse word
- On the conjugation of standard morphisms
- The ring of \(k\)-regular sequences
- Power of words and recognizability of fixpoints of a substitution
- Conjugacy and episturmian morphisms.
- Characterization of circular D0L-systems
- On permutations generated by infinite binary words
- Minimal complexity of equidistributed infinite permutations
- On periodicity and low complexity of infinite permutations
- DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
- Canonical Representatives of Morphic Permutations
- The Number of Permutations Realized By a Shift
- Automatic Sequences
- Permutation complexity of images of Sturmian words by marked morphisms
- Infinite interval exchange transformations from shifts
- Entropy of interval maps via permutations
- Infinite words with uniform frequencies, and invariant measures
