Constructing Premaximal Binary Cube-free Words of Any Level
arXiv:1108.3634 · doi:10.4204/EPTCS.63.23
Abstract
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.
In Proceedings WORDS 2011, arXiv:1108.3412