2000 character limit reached
Constructing Premaximal Binary Cube-free Words of Any Level
Published 18 Aug 2011 in cs.FL | (1108.3634v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
