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

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

2011-04-18

arxiv.org/abs/1104.3500v2

EPTCS 63, 2011, pp. 189-198

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.25

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.

Affiliated with

Also associated with

No associations

Rating

Fife's Theorem for (7/3)-Powers 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 for (7/3)-Powers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fife's Theorem for (7/3)-Powers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72264