Fife's Theorem Revisited

Details Fife's Theorem Revisited Fife's Theorem Revisited

2011-02-18

arxiv.org/abs/1102.3932v3

Computer Science

Formal Languages and Automata Theory

Scientific paper

We give another proof of a theorem of Fife - understood broadly as providing
a finite automaton that gives a complete description of all infinite binary
overlap-free words. Our proof is significantly simpler than those in the
literature. As an application we give a complete characterization of the
overlap-free words that are 2-automatic.

Affiliated with

Also associated with

No associations

Rating

Fife's Theorem Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fife's Theorem Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fife's Theorem Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159133