Constructing Premaximal Binary Cube-free Words of Any Level
Formal Languages and Automata Theory
2011-08-19 v1
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.
Cite
@article{arxiv.1108.3634,
title = {Constructing Premaximal Binary Cube-free Words of Any Level},
author = {Elena A. Petrova and Arseny M. Shur},
journal= {arXiv preprint arXiv:1108.3634},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412