{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:02:07Z","timestamp":1767913327133,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"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":11400,"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":[[1982,5]]},"DOI":"10.1016\/0304-3975(82)90023-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"221-226","source":"Crossref","is-referenced-by-count":49,"title":["Sharp characterizations of squarefree morphisms"],"prefix":"10.1016","volume":"18","author":[{"given":"Max","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90023-8_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\/0304-3975(82)90023-8_BIB2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-09510-1_2","article-title":"Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme","volume":"71","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(82)90023-8_BIB3","unstructured":"J. Berstel and C. Reutenauer, Squarefree words and idempotent semigroups,in: Lothaire, Ed. Combinatorics on Words (Addison\u2013Wesley, Reading,MA) Chapter 2, to appear."},{"key":"10.1016\/0304-3975(82)90023-8_BIB4","author":"Brandenburg","year":"1981","journal-title":"On non-repetitive strings"},{"key":"10.1016\/0304-3975(82)90023-8_BIB5","unstructured":"A. Ehrenfeucht and G. Tosenberg, On the separating power of EOL systems, RAIRO Informat. Th\u00e9r.., to appear."},{"key":"10.1016\/0304-3975(82)90023-8_BIB6","author":"Karhumaki","year":"1981","journal-title":"On cubicfree \u03c9-words generated by binary morphisms"},{"key":"10.1016\/0304-3975(82)90023-8_BIB7","series-title":"CS-81-070","article-title":"Repetitive strings are not context-free","author":"Ross","year":"1981"},{"key":"10.1016\/0304-3975(82)90023-8_BIB8","first-page":"1","article-title":"Uber die gegenseitige Lage gleicher teile gewisser Zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiana"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:20Z","timestamp":1555125980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0304397582900238"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90023-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}