Some characterizations of finite Sturmian words.

DOI10.1016/j.tcs.2006.01.036zbMath1160.68481OpenAlexW1968329633MaRDI QIDQ2490813

Aldo De Luca, Alessandro 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

zbMATH Keywords

central wordsturmian wordstandard word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

The sequence of open and closed prefixes of a Sturmian word ⋮ On a generalization of Christoffel words: epichristoffel words ⋮ A note on Sturmian words ⋮ Sturmian and Episturmian Words ⋮ Counting minimal semi-Sturmian words ⋮ Least Periods of Factors of Infinite Words ⋮ Rich, Sturmian, and trapezoidal words ⋮ Pseudopalindrome closure operators in free monoids ⋮ Studies on finite Sturmian 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

This page was built for publication: Some characterizations of finite Sturmian words.