Fife's Theorem for (7/3)-Powers
arXiv:1104.3500 · doi:10.4204/EPTCS.63.25
Abstract
We prove a Fife-like characterization of the infinite binary (7/3)-power-free words, by giving a finite automaton of 15 states that encodes all such words. As a consequence, we characterize all such words that are 2-automatic.
In Proceedings WORDS 2011, arXiv:1108.3412