{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:08:01Z","timestamp":1767906481609,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1016\/0020-0190(81)90121-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"108-113","source":"Crossref","is-referenced-by-count":17,"title":["On the subword complexity of DOL languages with a constant distribution"],"prefix":"10.1016","volume":"13","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":[{"key":"10.1016\/0020-0190(81)90121-6_BIB1","first-page":"16","article-title":"Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme","volume":"Vol. 71","author":"Berstel","year":"1979"},{"key":"10.1016\/0020-0190(81)90121-6_BIB2","unstructured":"A. Ehrenfeucht and G. Rozenberg. On subword complexities of homomorphic images of languages, Rev. Fr. Automat. Inform. Rech. Op\u00e9r., S\u00e9r. Rouge, to appear."},{"key":"10.1016\/0020-0190(81)90121-6_BIB3","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht and G. Rozenberg, On the subword complexity of square-free DOL languages, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(81)90028-1"},{"key":"10.1016\/0020-0190(81)90121-6_BIB4","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0020-0190(81)90121-6_BIB5","series-title":"Formal Language Theory","article-title":"Morphisms on free monoids and language theory","author":"Salomaa","year":"1980"},{"key":"10.1016\/0020-0190(81)90121-6_BIB6","unstructured":"A. Salomaa, Jewels of Language Theory, Computer Science Press, to appear."},{"key":"10.1016\/0020-0190(81)90121-6_BIB7","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I Math.-Nat. KI."},{"key":"10.1016\/0020-0190(81)90121-6_BIB8","first-page":"1","article-title":"\u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske Vid. Skr. I Math.-Nat."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:52:18Z","timestamp":1555059138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081901216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["0020019081901216"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90121-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}