2006/03/14 by Thierry Monteil, Monteil, Thierry, Solomon Marcus +1
Computer Science · Mathematics · #37A05 #37A35 #37B10 #68R15 #Cellular Automata and Applications #Combinatorics (math.CO) #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #math.CO #math.DS #msc:37A05 #msc:37A35 #msc:37B10 #msc:68R15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0603354
13 pages, 2 pictures
arxiv created 2006/03/14 · openalex publication_date 2006/03/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An infinite word x is said to be quasiperiodic if there exists a finite word q such that x is covered by occurrences of q (such a q is called a quasiperiod of x). Using the notion of derivation, we show that this definition is not sufficient to imply any symmetry in an infinite word. Therefore we introduce multi-scale quasiperiodic words, i.e. quasiperiodic words that admit an infinite number of quasiperiods. Such words are uniformly recurrent, this allows us to study the subshift they generate. We prove that multi-scale quasiperiodic subshifts are uniquely ergodic and have zero topological entropy as well as zero Kolmogorov complexity. Sturmian subshifts are shown to be multi-scale quasiperiodic.