Critical Exponents of Words over 3 Letters
Abstract
For all $\alpha \geq RT(3)$ (where $RT(3) = 7/4$ is the repetition threshold for the $3$-letter alphabet), there exists an infinite word over 3 letters whose critical exponent is $\alpha$.
For all $\alpha \geq RT(3)$ (where $RT(3) = 7/4$ is the repetition threshold for the $3$-letter alphabet), there exists an infinite word over 3 letters whose critical exponent is $\alpha$.