期刊名称:Electronic Proceedings in Theoretical Computer Science
电子版ISSN:2075-2180
出版年度:2011
卷号:63
页码:189-198
DOI:10.4204/EPTCS.63.25
出版社:Open Publishing Association
摘要: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.