{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:19Z","timestamp":1779448279134,"version":"3.53.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,3,11]],"date-time":"2027-03-11T00:00:00Z","timestamp":1804723200000},"content-version":"am","delay-in-days":314,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"ANR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115875","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T16:07:36Z","timestamp":1772899656000},"page":"115875","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["More characterizations of morphic words"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5550-7149","authenticated-orcid":false,"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5504-4586","authenticated-orcid":false,"given":"Pascal","family":"Ochem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115875_bib0001","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl Christiania"},{"issue":"2","key":"10.1016\/j.tcs.2026.115875_bib0002","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcta.2003.12.004","article-title":"Polynomial versus exponential growth in repetition-free binary words","volume":"105","author":"Karhum\u00e4ki","year":"2004","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"10.1016\/j.tcs.2026.115875_bib0003","first-page":"11","article-title":"Antisquares and critical exponents","volume":"25","author":"Baranwal","year":"2023","journal-title":"Discr. Math. Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115875_bib0004","doi-asserted-by":"crossref","first-page":"P4","DOI":"10.37236\/11555","article-title":"Complement avoidance in binary words","volume":"32","author":"Currie","year":"2025","journal-title":"Electron. J. Combin."},{"issue":"# P2.29","key":"10.1016\/j.tcs.2026.115875_bib0005","article-title":"Critical exponent of binary words with few distinct palindromes","volume":"31","author":"Dvo\u0159akov\u00e1","year":"2024","journal-title":"Electron. J. Combin"},{"issue":"# P4.30","key":"10.1016\/j.tcs.2026.115875_bib0006","article-title":"Avoidability of formulas with two variables","volume":"24","author":"Ochem","year":"2017","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2026.115875_bib0007","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.tcs.2015.03.044","article-title":"Characterization of some binary words with few squares","volume":"588","author":"Badkobeh","year":"2015","journal-title":"Theor. Comput. Sci."},{"issue":"Article 23.8.2","key":"10.1016\/j.tcs.2026.115875_bib0008","article-title":"The analog of overlap-freeness for the period-doubling sequence","volume":"26","author":"Currie","year":"2023","journal-title":"Journal of Integer Sequences"},{"issue":"1","key":"10.1016\/j.tcs.2026.115875_bib0009","article-title":"Properties of a ternary infinite word","volume":"57","author":"Currie","year":"2023","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"10.1016\/j.tcs.2026.115875_bib0010","first-page":"1","article-title":"\u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"10.1016\/j.tcs.2026.115875_bib0011","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0304-3975(89)90071-6","article-title":"Growth problems for avoidable words","volume":"69","author":"Baker","year":"1989","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115875_bib0012","series-title":"Technical Report","article-title":"Motifs \u00e9vitables et r\u00e9gularit\u00e9 dans les mots","author":"Cassaigne","year":"1994"},{"key":"10.1016\/j.tcs.2026.115875_bib0013","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1051\/ita:2006020","article-title":"A generator of morphisms for infinite words","volume":"40","author":"Ochem","year":"2006","journal-title":"RAIRO - Theor. Inf. Appl"},{"key":"10.1016\/j.tcs.2026.115875_bib0014","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cosrev.2012.09.001","article-title":"Growth properties of power-free languages","volume":"6","author":"Shur","year":"2012","journal-title":"Comput. Sci. Rev."},{"issue":"# P1.12","key":"10.1016\/j.tcs.2026.115875_bib0015","article-title":"On some interesting ternary formulas","volume":"26","author":"Ochem","year":"2019","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2026.115875_bib0016","series-title":"IFIP Congress","first-page":"459","article-title":"An algorithm to test if a given circular HDOL-language avoids a pattern","author":"Cassaigne","year":"1994"},{"issue":"1","key":"10.1016\/j.tcs.2026.115875_bib0017","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1051\/ita\/2010010","article-title":"Binary words avoiding the pattern AABBCABBA","volume":"44","author":"Ochem","year":"2010","journal-title":"RAIRO - Theoret. Informa. Appl."},{"issue":"5","key":"10.1016\/j.tcs.2026.115875_bib0018","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.ipl.2015.01.004","article-title":"Infinite binary words containing repetitions of odd period","volume":"115","author":"Badkobeh","year":"2015","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2026.115875_bib0019","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(91)90134-N","article-title":"Which graphs allow infinite nonrepetitive walks?","volume":"87","author":"Currie","year":"1991","journal-title":"Discr. Math."},{"key":"10.1016\/j.tcs.2026.115875_bib0020","unstructured":"T. Harju, Square-free walks on labelled graphs, (2011) arXiv: 1106.4106."},{"key":"10.1016\/j.tcs.2026.115875_bib0021","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","article-title":"Sur un th\u00e9or\u00e8me de thue","volume":"13","author":"Dejean","year":"1972","journal-title":"J. Combin. Theory. Ser. A"},{"key":"10.1016\/j.tcs.2026.115875_bib0022","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.tcs.2022.04.025","article-title":"Avoiding square-free words on free groups","volume":"922","author":"Badkobeh","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115875_bib0023","doi-asserted-by":"crossref","first-page":"6625","DOI":"10.1016\/j.tcs.2011.08.011","article-title":"Fewest repetitions vs maximal-exponent powers in infinite binary words","volume":"412","author":"Badkobeh","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"# P1.4","key":"10.1016\/j.tcs.2026.115875_bib0024","article-title":"Avoidability of palindrome patterns","volume":"28","author":"Ochem","year":"2021","journal-title":"Electron. J. Combin."},{"issue":"# P1.19","key":"10.1016\/j.tcs.2026.115875_bib0025","article-title":"Doubled patterns are 3-avoidable","volume":"23","author":"Ochem","year":"2016","journal-title":"Electron. J. Combin."},{"issue":"# P1.50","key":"10.1016\/j.tcs.2026.115875_bib0026","article-title":"Doubled patterns with reversal and square-free doubled patterns","volume":"30","author":"Domenech","year":"2023","journal-title":"Electron. J. Combin."},{"issue":"3","key":"10.1016\/j.tcs.2026.115875_bib0027","article-title":"The simplest binary word with only three squares","volume":"55","author":"Gabric","year":"2021","journal-title":"RAIRO - Theor. Inf. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:42Z","timestamp":1779447762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":27,"alternative-id":["S0304397526001349"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115875","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"More characterizations of morphic words","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115875","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115875"}}