Abstract
We call a one-way infinite word w over a finite alphabet (ρ,p)-repetitive if all long enough prefixes of w contain as a suffix a repetition of order p of a word of length at most p. We show that each (2, 4)-repetitive word is ultimately periodic, as well as that there exist nondenumerably many, and hence also nonultimately periodic, (2,5)-repetitive words. Further we characterize nonultimately periodic (2, 5)-repetitive words both structurally and algebraically.
Cite
CITATION STYLE
Karhumäki, J., Lepistö, A., & Plandowski, W. (1998). Locally periodic infinite words and a chaotic behaviour. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 421–430). Springer Verlag. https://doi.org/10.1007/bfb0055072
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
