More characterizations of morphic words
Combinatorics
2025-08-20 v2
Abstract
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 example is the Hall-Thue word, fixed point of the morphism , , , which is essentially the only ternary word avoiding squares and the words \texttt{010} and \texttt{212}. We provide some examples of this phenomenon from various contexts.
Cite
@article{arxiv.2312.10757,
title = {More characterizations of morphic words},
author = {Golnaz Badkobeh and Pascal Ochem},
journal= {arXiv preprint arXiv:2312.10757},
year = {2025}
}