Fife's Theorem for (7/3)-Powers
Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur · Electronic Proceedings in Theoretical Computer Science · 2011
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.