Constructing Premaximal Binary Cube-free Words of Any Level

Elena A. Petrova
(Ural Federal University)
Arseny M. Shur
(Ural Federal University)

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 Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 168–178.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.23 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org