Mathematics – Combinatorics
Scientific paper
2008-05-06
Theoretical Computer Science 409 (2008) 578-600
Mathematics
Combinatorics
33 pages; minor changes
Scientific paper
10.1016/j.tcs.2008.09.056
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in terms of their "directive words". Even further, we establish a complete characterization of all episturmian words that are Lyndon words. Our main results show that, unlike the Sturmian case, there is a much wider class of episturmian words that are non-quasiperiodic, besides those that are infinite Lyndon words. Our key tools are morphisms and directive words, in particular "normalized" directive words, which we introduced in an earlier paper. Also of importance is the use of "return words" to characterize quasiperiodic episturmian words, since such a method could be useful in other contexts.
Glen Amy
Levé Florence
Richomme Gwénaël
No associations
LandOfFree
Quasiperiodic and Lyndon episturmian words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quasiperiodic and Lyndon episturmian words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasiperiodic and Lyndon episturmian words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-209238