The Ehrenfeucht-Silberger problem

DOI10.1016/j.jcta.2011.11.004zbMath1242.68194OpenAlexW2039842951MaRDI QIDQ662035

Štěpán Holub, Dirk Nowotka

Publication date: 11 February 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2011.11.004

zbMATH Keywords

periodicitycombinatorics on wordsunbordered wordsEhrenfeucht-Silberger problem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Fully bordered words ⋮ On Maximal Unbordered Factors ⋮ Unnamed Item ⋮ Maximal unbordered factors of random strings

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Periodes et repetitions des mots du monoide libre
• Une caractérisation des mots périodiques
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Unbordered factors and Lyndon words
• Real-Time Streaming String-Matching
• MINIMAL DUVAL EXTENSIONS
• Periodicity and unbordered words
• Two-way string-matching
• A Note on a Conjecture of Duval and Sturmian Words
• STACS 2004

This page was built for publication: The Ehrenfeucht-Silberger problem