Sciweavers

JACM
2007

Periodicity and unbordered words: A proof of the extended duval conjecture

13 years 10 months ago
Periodicity and unbordered words: A proof of the extended duval conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word bordered if it has a proper prefix which is also a suffix of that word. Let µ(w) denote the maximum length of all unbordered factors of w, and let ∂(w) denote the period of w. Clearly, µ(w) ≤ ∂(w).
Tero Harju, Dirk Nowotka
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JACM
Authors Tero Harju, Dirk Nowotka
Comments (0)