Some characterizations of finite Sturmian words.
From MaRDI portal
Publication:2490813
DOI10.1016/j.tcs.2006.01.036zbMath1160.68481MaRDI QIDQ2490813
Alessandro De Luca, Aldo De Luca
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.036
68R15: Combinatorics on words
Related Items
A note on Sturmian words, On a generalization of Christoffel words: epichristoffel words, Rich, Sturmian, and trapezoidal words, Studies on finite Sturmian words, The sequence of open and closed prefixes of a Sturmian word, Counting minimal semi-Sturmian words, Pseudopalindrome closure operators in free monoids, Sturmian and Episturmian Words, Least Periods of Factors of Infinite Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the combinatorics of finite words
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Characterisations of balanced words via orderings
- Moments of conjugacy classes of binary words
- Random generation of finite Sturmian words
- MINIMAL DUVAL EXTENSIONS
- A linear algorithm for nonhomogeneous spectra of numbers
- Vision Geometry
- A remark on morphic sturmian words
- A Note on a Conjecture of Duval and Sturmian Words
- Developments in Language Theory
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES