Fife's Theorem for (7/3)-Powers
  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. 
Narad Rampersad (Department of Mathematics, University of Li\`ege),   Jeffrey Shallit (School of Computer Science, Universit...
cs.FL cs.DM