More characterizations of morphic words
Badkobeh, G. 
ORCID: 0000-0001-5550-7149 & Ochem, P. (2026).
More characterizations of morphic words.
Theoretical Computer Science, 1072,
article number 115875.
doi: 10.1016/j.tcs.2026.115875
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 0→012, 1→02, 2→1, which is essentially the only ternary word avoiding squares and the factors 010 and 212. We provide some examples of this phenomenon from various contexts.
| Publication Type: | Article |
|---|---|
| Additional Information: | © 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies. This is the accepted manuscript of an article published by Elsevier. Please refer to the publisher’s terms and conditions for information on re-use. |
| Publisher Keywords: | Combinatorics on words, Pattern avoidance |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Departments: | School of Science & Technology School of Science & Technology > Department of Computer Science |
| SWORD Depositor: |
![[thumbnail of Morphic_words_2023.pdf]](https://openaccess.city.ac.uk/style/images/fileicons/text.png "Morphic_words_2023.pdf")
Text
- Accepted Version
This document is not freely accessible until 7 March 2027 due to copyright restrictions.
Available under License Creative Commons Attribution Non-commercial No Derivatives.
To request a copy, please use the button below.
Request a copy
Official URL: https://doi.org/10.1016/j.tcs.2026.115875
Export
Downloads
Downloads per month over past year
Metadata
Metadata
MetadataCORE (COnnecting REpositories)
Actions (login required)
Actions (login required)
Admin Login