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 ...
One of the first finding was that an infinite binary word can avoid words with an exponent larger than 2, called 2+-powers. This has been extended by. Dejean [4] ...
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 ...
It is shown that FRt(3)=r(3)=7/4 and that the bound is achieved with an infinite word containing only two 7/4-exponent words, the smallest number, ...
In this article we produce an infinite word with few distinct squares and a smaller maximal exponent. Fraenkel and Simpson's proof uses a pair of morphisms, one ...
Fewest repetitions versus maximal-exponent powers in infinite binary words · Golnaz Badkobeh ; Infinite words containing the minimal number of repetitions.
The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of the fact that there exists an ...
Jul 24, 2012 · Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3.
Missing: maximal- powers
Fewest repetitions in infinite binary words - ResearchGate
www.researchgate.net › publication › 22...
Aug 30, 2015 · Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3.
Bibliographic details on Fewest repetitions versus maximal-exponent powers in infinite binary words.