More characterizations of morphic words

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Theoretical Computer Science Pub Date : 2026-05-12 Epub Date: 2026-03-07 DOI:10.1016/j.tcs.2026.115875
Golnaz Badkobeh, Pascal Ochem
{"title":"More characterizations of morphic words","authors":"Golnaz Badkobeh,&nbsp;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 0012, 102, 21, 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.
更多的词形特征
单词组合学中一个有趣的现象是,每个满足回避约束的循环词都具有与词形词相同的因子集。一个早期的例子是Hall-Thue词,它是构词0→012,1→02,2→1的不动点,它本质上是唯一一个避免平方和因子010和212的三元词。我们从不同的语境中提供了一些这种现象的例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书