Alexandre Blondin-Massé, Srecko Brlek, Amy Glen, Sébastien Labbé
Published 2007-10-22Version 1
For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.
Comments: 13 pages; to appear in Discrete Mathematics and Theoretical Computer Science (accepted October 15, 2007)
Journal: Discrete Mathematics and Theoretical Computer Science 9 (2007) 293-304
Computing the k-binomial complexity of generalized Thue--Morse words
Occurrences of palindromes in characteristic Sturmian words
For each $α$ > 2 there is an infinite binary word with critical exponent $α$
![QR code for arXiv:0710.4031 [math.CO]](http://oss.arxitics.com/images/favicon.svg)