Back to Search
Start Over
The Repetition Threshold for Rote Sequences
- Publication Year :
- 2024
-
Abstract
- 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.<br />Comment: The attached html and ipynb files illustrate the ideas and give the Walnut code
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2406.17867
- Document Type :
- Working Paper