Unbordered factors and Lyndon words

DOI10.1016/j.disc.2006.09.054zbMath1146.68062OpenAlexW2152996055MaRDI QIDQ2483406

Tero J.Harju, Dirk Nowotka, Jean-Pierre Duval

Publication date: 28 April 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.054

zbMATH Keywords

Sturmian wordsLyndon wordscombinatorics on wordsDuval's conjectureunbordered factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

Automatic Theorem-Proving in Combinatorics on Words ⋮ On the Relation between Periodicity and Unbordered Factors of Finite Words ⋮ The Ehrenfeucht-Silberger problem ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ On the Number of Unbordered Factors ⋮ ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS

Cites Work

• Unnamed Item
• A proof of the extended Duval's conjecture
• 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
• MINIMAL DUVAL EXTENSIONS
• A Note on a Conjecture of Duval and Sturmian Words
• STACS 2004
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Unbordered factors and Lyndon words