Constructing premaximal binary cube-free words of any level
From MaRDI portal
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.
Recommendations
- Constructing premaximal binary cube-free words of any level
- Constructing premaximal ternary square-free words of any level
- On the tree of binary cube-free words
- Binary patterns in binary cube-free words: avoidability and growth
- The number of binary cube-free words of length up to 47 and their numerical analysis
- scientific article; zbMATH DE number 5237248
- Nondeterministic automatic complexity of almost square-free and strongly cube-free words
- A construction for a class of binary words avoiding 1ʲ⁰^i
- On the maximum number of cubic subwords in a word
- The structure of the set of cube-free Z-words in a two-letter alphabet
Cited in
(8)- On the tree of binary cube-free words
- The structure of the set of cube-free Z-words in a two-letter alphabet
- Constructing premaximal binary cube-free words of any level
- The number of binary cube-free words of length up to 47 and their numerical analysis
- Cubefree words with many squares
- Transition property for cube-free words
- Transition property for cube-free words
- Construction of a bi-infinite power free word with a given factor and a non-recurrent letter
This page was built for publication: Constructing premaximal binary cube-free words of any level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789527)
