Fife's Theorem for (7/3)-Powers
Formal Languages and Automata Theory
2011-08-19 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1104.3500,
title = {Fife's Theorem for (7/3)-Powers},
author = {Narad Rampersad and Jeffrey Shallit and Arseny Shur},
journal= {arXiv preprint arXiv:1104.3500},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412