A characterization of words of linear complexity
From MaRDI portal
Publication:5384833
DOI10.1090/PROC/14440zbMath1423.68368OpenAlexW2905291734WikidataQ128740667 ScholiaQ128740667MaRDI QIDQ5384833
Julien Cassaigne, Svetlana Puzynina, Luca Q. Zamboni, Anna E. Frid
Publication date: 26 June 2019
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/proc/14440
Related Items (2)
On the character of words of sublinear complexity ⋮ Characterizations of families of morphisms and words via binomial complexities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some improvements of the \(S\)-adic conjecture
- Substitutions in dynamics, arithmetics and combinatorics
- Substitution dynamical systems - spectral analysis
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Subword complexities of various classes of deterministic developmental languages without interactions
- Sequences with subword complexity \(2n\)
- Enumeration of factors in the Thue-Morse word
- Subword Complexity and Decomposition of the Set of Factors
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Automatic Sequences
- Episturmian words: a survey
- Factor complexity
- SMALL DENOMINATORS AND PROBLEMS OF STABILITY OF MOTION IN CLASSICAL AND CELESTIAL MECHANICS
- Symbolic Dynamics II. Sturmian Trajectories
This page was built for publication: A characterization of words of linear complexity
