{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:28:37Z","timestamp":1767907717031,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0304-3975(81)90028-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"25-32","source":"Crossref","is-referenced-by-count":28,"title":["On the subword complexity of square-free DOL languages"],"prefix":"10.1016","volume":"16","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\/0304-3975(81)90028-1_BIB1","first-page":"16","article-title":"Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme","volume":"71","author":"Berstel","year":"1979"},{"issue":"3","key":"10.1016\/0304-3975(81)90028-1_BIB2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(80)90151-X","article-title":"Mots sans carr\u00e9 et morphismes iter\u00e9s","volume":"29","author":"Berstel","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(81)90028-1_BIB3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0022-0000(71)80006-5","article-title":"Classification of noncounting events","volume":"5","author":"Brzozowski","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(81)90028-1_BIB4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","article-title":"Subword complexities of various classes of deterministic developmental languages without interactions","volume":"1","author":"Ehrenfeucht","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90028-1_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-1978-2112","article-title":"On the structure of polynomially bounded DOL systems","volume":"2","author":"Ehrenfeucht","year":"1979","journal-title":"Fund. Informaticae"},{"key":"10.1016\/0304-3975(81)90028-1_BIB6","series-title":"Technical Report CU-CS-173-80","article-title":"On subword complexities of homomorphic images of languages","author":"Ehrenfeucht","year":"1980"},{"key":"10.1016\/0304-3975(81)90028-1_BIB7","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(81)90028-1_BIB8","first-page":"301","article-title":"On irreducible languages and nonrational numbers","volume":"21","author":"Istrail","year":"1977","journal-title":"Bull. Soc. Math. Roumanie"},{"key":"10.1016\/0304-3975(81)90028-1_BIB9","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(81)90028-1_BIB10","unstructured":"A. Salomaa, Morphisms on free monoids and language theory, in: R. Book, Ed., Formal Language Theory: Perspectives and Open Problems (Academic Press, New York) to appear."},{"key":"10.1016\/0304-3975(81)90028-1_BIB11","first-page":"1","article-title":"\u00dcber unendliche zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I Mat.-Nat. Kl."},{"key":"10.1016\/0304-3975(81)90028-1_BIB12","first-page":"1","article-title":"\u00dcber die gegenseitige lage gleicher teile gewisser zeichenreichen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr. I Mat.-Nat. Kl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:59:15Z","timestamp":1621033155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581900281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581900281"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90028-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}