Low complexity binary words avoiding $(5/2)^+$-powers
By: Narad Rampersad, James Currie
Potential Business Impact:
Finds patterns in endless word lists.
Rote words are infinite words that contain $2n$ factors of length $n$ for every $n \geq 1$. Shallit and Shur, as well as Ollinger and Shallit, showed that there are Rote words that avoid $(5/2)^+$-powers and that this is best possible. In this note we give a structure theorem for the Rote words that avoid $(5/2)^+$-powers, confirming a conjecture of Ollinger and Shallit.
Similar Papers
Low complexity binary words avoiding $(5/2)^+$-powers
Combinatorics
Finds patterns in endless word lists.
Low complexity binary words avoiding $(5/2)^+$-powers
Combinatorics
Makes infinite word patterns avoid repeating too much.
Words with factor somplexity $2n+1$ and minimal critical exponent
Combinatorics
Finds patterns in words that are very hard to break.