Narad Rampersad (Department of Mathematics, University of Liège) |
Jeffrey Shallit (School of Computer Science, University of Waterloo) |
Arseny Shur (Department of Algebra and Discrete Mathematics, Ural Federal University) |

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. |

Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.25 | bibtex |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |