The Repetition Threshold for Rote Sequences
Combinatorics
2024-07-02 v3 Discrete Mathematics
Formal Languages and Automata Theory
Abstract
We consider Rote words, which are infinite binary words with factor complexity . We prove that the repetition threshold for this class is . 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.
Cite
@article{arxiv.2406.17867,
title = {The Repetition Threshold for Rote Sequences},
author = {Nicolas Ollinger and Jeffrey Shallit},
journal= {arXiv preprint arXiv:2406.17867},
year = {2024}
}
Comments
The attached html and ipynb files illustrate the ideas and give the Walnut code