Fewest repetitions versus maximal-exponent powers in infinite binary words

详细信息    查看全文

• 作者：Golnaz  ; Badkobeh  ; ;   ; ^a ;   ; ^{golnaz.badkobeh@kcl.ac.uk}
• 关键词：Combinatorics on words ; Repetitions ; Repetitive threshold ; Word morphisms
• 刊名：Theoretical Computer Science
• 出版年：2011
• 出版时间：11 November 2011
• 年：2011
• 卷：412
• 期：48
• 页码：6625-6633
• 全文大小：262 K

文摘

A square is the concatenation of a nonempty word with itself. A word has period if its letters at distance match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give some new results on the trade-off between the number of squares and the number of maximal-exponent powers in infinite binary words, in the three cases where the maximal exponent is 7/3, 5/2, and 3. These are the only threshold values related to the question.