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 定理证明器以及由第一作者及其合作者提出的从态射生成自动机的新方法。