MINIMAL DUVAL EXTENSIONS

DOI10.1142/S0129054104002467zbMath1067.68112OpenAlexW2047088605MaRDI QIDQ3022004

Dirk Nowotka, Tero Barju

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002467

zbMATH Keywords

periodicitySturmian wordsLyndon wordscombinatorics on wordsDuval's conjectureunbordered factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (12)

On prefixal factorizations of words ⋮ On the Relation between Periodicity and Unbordered Factors of Finite Words ⋮ Infinite self-shuffling words ⋮ On generating binary words palindromically ⋮ The Ehrenfeucht-Silberger problem ⋮ Least Periods of Factors of Infinite Words ⋮ Unbordered factors and Lyndon words ⋮ ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS ⋮ Some characterizations of finite Sturmian words. ⋮ A proof of the extended Duval's conjecture ⋮ Standard factors of Sturmian words ⋮ Studies on finite Sturmian words

Cites Work

• Unnamed Item
• Periodicity and unbordered segments of words
• Relationship between the period of a finite word and the length of its unbordered segments
• Une caractérisation des mots périodiques
• Lyndon words and singular factors of sturmian words
• Certain words on the real projective line
• Sturmian words, Lyndon words and trees
• A Note on a Conjecture of Duval and Sturmian Words

This page was built for publication: MINIMAL DUVAL EXTENSIONS