| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438449 | Theoretical Computer Science | 2007 | 11 Pages |
Abstract
We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
