Constructing Premaximal Binary Cube-free Words of Any Level

Details Constructing Premaximal Binary Cube-free Words of Any Level Constructing Premaximal Binary Cube-free Words of Any Level

2011-08-18

arxiv.org/abs/1108.3634v1

EPTCS 63, 2011, pp. 168-178

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.23

We study the structure of the language of binary cube-free words. Namely, we
are interested in the cube-free words that cannot be infinitely extended
preserving cube-freeness. We show the existence of such words with arbitrarily
long finite extensions, both to one side and to both sides.

Affiliated with

Also associated with

No associations

Rating

Constructing Premaximal Binary Cube-free Words of Any Level 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 Constructing Premaximal Binary Cube-free Words of Any Level, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing Premaximal Binary Cube-free Words of Any Level will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180634