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

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-72264

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.