Locally Periodic Versus Globally Periodic Infinite Words

We call a one-way infinite word w over a finite alphabet (ρ, l)-repetitive if all long enough prefixes of w contain as a suffix a ρth power (or more generally a repetition of order ρ) of a word of length at most l. We show that each (2,4)- repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, (2, 5)-repetitive words. Further, we characterize nonultimately periodic (2, 5)-repetitive words both structurally and algebraically.

[1]  Antonio Restivo,et al.  A Periodicity Theorem on Words and Applications , 1995, MFCS.

[2]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .

[3]  Antonio Restivo,et al.  Periodicity and the Golden Ratio , 1998, Theor. Comput. Sci..

[4]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[5]  Christian Choffrut,et al.  Combinatorics of Words , 1997, Handbook of Formal Languages.

[6]  Filippo Mignosi,et al.  Repetitions in the Fibonacci infinite word , 1992, RAIRO Theor. Informatics Appl..