A1 Refereed original research article in a scientific journal
Minimal Duval extensions
Authors: Harju T, Nowotka D
Publisher: WORLD SCIENTIFIC PUBL CO PTE LTD
Publication year: 2004
Journal:: International Journal of Foundations of Computer Science
Journal name in source: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Journal acronym: INT J FOUND COMPUT S
Volume: 15
Issue: 2
First page : 349
Last page: 354
Number of pages: 6
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054104002467
Abstract
A word v = wu is a (nontrivial) Duval extension of the unbordered word w, if (u is not a prefix of v and) w is an unbordered factor of v of maximum length. After a short survey of the research topic related to Duval extensions, we show that, if wu is a minimal Duval extension, then u is a factor of w. We also show that finite, unbordered factors of Sturmian words are Lyndon words.
A word v = wu is a (nontrivial) Duval extension of the unbordered word w, if (u is not a prefix of v and) w is an unbordered factor of v of maximum length. After a short survey of the research topic related to Duval extensions, we show that, if wu is a minimal Duval extension, then u is a factor of w. We also show that finite, unbordered factors of Sturmian words are Lyndon words.
UTU Research Portal