{"title":"More characterizations of morphic words","authors":"Golnaz Badkobeh, Pascal Ochem","doi":"10.1016/j.tcs.2026.115875","DOIUrl":null,"url":null,"abstract":"<div><div>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 <span><math><mrow><mn>0</mn><mo>→</mo><mn>012</mn></mrow></math></span>, <span><math><mrow><mn>1</mn><mo>→</mo><mn>02</mn></mrow></math></span>, <span><math><mrow><mn>2</mn><mo>→</mo><mn>1</mn></mrow></math></span>, which is essentially the only ternary word avoiding squares and the factors <span>010</span> and <span>212</span>. We provide some examples of this phenomenon from various contexts.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1072 ","pages":"Article 115875"},"PeriodicalIF":1.0000,"publicationDate":"2026-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397526001349","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/3/7 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
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 factors 010 and 212. We provide some examples of this phenomenon from various contexts.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.