Complement avoidance in binary words
The complement $\overline {x} $ of a binary word $ x $ is obtained by changing each $0 $ in
$ x $ to $1 $ and vice versa. We study infinite binary words $\bf w $ that avoid sufficiently …
$ x $ to $1 $ and vice versa. We study infinite binary words $\bf w $ that avoid sufficiently …
The repetition threshold for ternary rich words
In 2014, Vesti proposed the problem of determining the repetition threshold for infinite rich
words, ie, for infinite words in which all factors of length $ n $ contain $ n $ distinct nonempty …
words, ie, for infinite words in which all factors of length $ n $ contain $ n $ distinct nonempty …
More characterizations of morphic words
G Badkobeh, P Ochem - arXiv preprint arXiv:2312.10757, 2023 - arxiv.org
An interesting phenomenon in combinatorics on words is when every recurrent word
satisfying some avoidance constraints has the same factor set as a morphic word. An early …
satisfying some avoidance constraints has the same factor set as a morphic word. An early …