A proof of the extended Duval's conjecture

DOI10.1016/J.TCS.2005.01.008zbMath1127.68075OpenAlexW2015040013WikidataQ105697912 ScholiaQ105697912MaRDI QIDQ557916

Štěpán Holub

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.008

zbMATH Keywords

unbordered wordsCombinatorics on wordsDuval's conjecture

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (8)

Fully bordered words ⋮ 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 ⋮ Unbordered factors and Lyndon words ⋮ ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS

Cites Work

• 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
• Two-way string-matching
• STACS 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the extended Duval's conjecture