The Repetition Threshold for Rote Sequences
<|reference_start|>The Repetition Threshold for Rote Sequences: 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 computational, using the Walnut theorem prover and a new technique for generating automata from morphisms due to the first author and his co-authors.<|reference_end|>
@article{ollinger2024the,
    title={The Repetition Threshold for Rote Sequences},
    author={Nicolas Ollinger, Jeffrey Shallit},
    journal={arXiv preprint arXiv:2406.17867},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17867},
    primaryClass={math.CO cs.DM cs.FL}
}