More characterizations of morphic words
Theoretical Computer Science · 2026-05 · 1072 · 115875
DOI: 10.1016/j.tcs.2026.115875 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-05. Verfasst von Golnaz Badkobeh und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Gefördert von: ANR.
Abstract (Originalsprache)
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 $\texttt{0}\to\texttt{012}$, $\texttt{1}\to\texttt{02}$, $\texttt{2}\to\texttt{1}$, 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.
Förderung
- ANR
Zitieren
APA
Badkobeh, G., & Ochem, P. (2026). More characterizations of morphic words. Theoretical Computer Science, 1072, 115875. https://doi.org/10.1016/j.tcs.2026.115875
Vancouver
Badkobeh G, Ochem P. More characterizations of morphic words. Theoretical Computer Science. 2026;1072:115875. doi:10.1016/j.tcs.2026.115875
BibTeX
@article{Badkobeh2026,
author = {Badkobeh, Golnaz and Ochem, Pascal},
title = {More characterizations of morphic words},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1072},
pages = {115875},
doi = {10.1016/j.tcs.2026.115875}
}
EUVIMED