2006/01/09 by Florence Levé, Levé, Florence, Gwénaël Richomme +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Geometric and Algebraic Topology #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0601027
openalex publication_date 2006/01/09 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
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.