1 paper · 1 filter
Nicolas Ollinger, Jeffrey Shallit
We consider Rote words, which are infinite binary words with factor complexity 2n. We prove that the repetition threshold for this class is 5/2. Our technique is purely computa…