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.

翻译：我们研究罗特词，即因子复杂度为$2n$的无限二进制词。我们证明该类词的重复阈值为$5/2$。我们的技术完全基于计算，使用了Walnut定理证明器以及第一作者与其合作者提出的从态射生成自动机的新方法。