{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:56:05Z","timestamp":1761742565161},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/s0019-9958(83)80028-x","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T07:12:14Z","timestamp":1115104334000},"page":"13-35","source":"Crossref","is-referenced-by-count":19,"title":["Repetition of subwords in DOL languages"],"prefix":"10.1016","volume":"59","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0019-9958(83)80028-X_bib1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","article-title":"Avoidable patterns in strings of symbols","volume":"85","author":"Bean","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0019-9958(83)80028-X_bib2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-09510-1_2","article-title":"Sur les mots sans carre definis par un morphisme","volume":"Vol. 71","author":"Berstel","year":"1979","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"10.1016\/S0019-9958(83)80028-X_bib3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","article-title":"Uniform tag sequences","volume":"6","author":"Cobham","year":"1972","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(83)80028-X_bib4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/S0019-9958(78)90095-5","article-title":"Simplifications of homomorphisms","volume":"38","author":"Ehrenfeucht","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(83)80028-X_bib5","first-page":"187","article-title":"On the structure of polynomially bounded DOL systems","volume":"2","author":"Ehrenfeucht","year":"1979","journal-title":"Fund. Inform."},{"key":"10.1016\/S0019-9958(83)80028-X_bib6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","article-title":"On the subword complexity of square-free DOL languages","volume":"16","author":"Ehrenfeucht","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(83)80028-X_bib7","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0019-9958(83)80028-X_bib8","unstructured":"J. Karhumaki, on cubic-free \u03c9-words generated by binary morphisms, Discrete Appl. Math., in press."},{"key":"10.1016\/S0019-9958(83)80028-X_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1215\/S0012-7094-44-01101-4","article-title":"Unending chess, symbolic dynamics and a problem of semigroups","volume":"11","author":"Morse","year":"1944","journal-title":"Duke Math. J."},{"key":"10.1016\/S0019-9958(83)80028-X_bib10","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0019-9958(83)80028-X_bib11","series-title":"Formal Language Theory, Perspectives, and Open Problems","first-page":"141","article-title":"Morphisms on free monoids and language theory","author":"Salomaa","year":"1980"},{"key":"10.1016\/S0019-9958(83)80028-X_bib12","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/S0019-9958(83)80028-X_bib13","first-page":"1","article-title":"Uber undendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I Mat. Nat. KL., Christiania"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588380028X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588380028X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:55:58Z","timestamp":1548514558000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999588380028X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["S001999588380028X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80028-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}