pith. sign in

arxiv: 1104.3500 · v2 · pith:GJXKAGFYnew · submitted 2011-04-18 · 💻 cs.FL · cs.DM

Fife's Theorem for (7/3)-Powers

Narad Rampersad (Department of Mathematics , University of Li\`ege) , Jeffrey Shallit (School of Computer Science , University of Waterloo) , Arseny Shur (Department of Algebra , Discrete Mathematics , Ural Federal University) This is my paper
classification 💻 cs.FL cs.DM
keywords wordsautomaticautomatonbinarycharacterizationcharacterizeconsequenceencodes
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.