| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334740 | Theoretical Computer Science | 2005 | 7 Pages |
Abstract
We give a short and elementary proof of the following stronger version of Duval's conjecture: let u be an unbordered word, and v a word of length |u|-1, such that v is not a prefix of u. Then uv contains an unbordered word of length at least |u|+1.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Å tÄpán Holub,