{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:14:03Z","timestamp":1767903243163,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"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":[[1989,1]]},"DOI":"10.1016\/0304-3975(89)90064-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"1-17","source":"Crossref","is-referenced-by-count":10,"title":["Avoidable patterns on two letters"],"prefix":"10.1016","volume":"63","author":[{"given":"Ursula","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90064-9_BIB1","article-title":"Growth problems for avoidable words","author":"Baker","year":"1987","journal-title":"Private communication"},{"key":"10.1016\/0304-3975(89)90064-9_BIB2","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(89)90064-9_BIB3","series-title":"Proc. of the Internat. Coll. on Automata, Languages and Programming","first-page":"16","article-title":"Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme","volume":"71","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(89)90064-9_BIB4","article-title":"Mots de Fibonacci","author":"Berstel","year":"1981","journal-title":"S\u00e9minaire d'Informatique Th\u00e9orique 1980\u201381"},{"key":"10.1016\/0304-3975(89)90064-9_BIB5","series-title":"Proc. STACS 84","first-page":"14","article-title":"Some recent results on square-free words","volume":"166","author":"Berstel","year":"1984"},{"key":"10.1016\/0304-3975(89)90064-9_BIB6","article-title":"R\u00e9gularit\u00e9s \u00e9vitables","author":"Crochemore","year":"1983","journal-title":"Th\u00e8se d'Etat"},{"key":"10.1016\/0304-3975(89)90064-9_BIB7","series-title":"Combinatorics on Words","author":"Lothaire","year":"1984"},{"key":"10.1016\/0304-3975(89)90064-9_BIB8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(89)90064-9_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0305004100046077","article-title":"Non-repetitive sequences","volume":"68","author":"Pleasant","year":"1970","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0304-3975(89)90064-9_BIB10","first-page":"49","article-title":"On weakly square-free words","volume":"21","author":"Restivo","year":"1983","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(89)90064-9_BIB11","article-title":"Motifs in\u00e9vitables dans les mots","author":"Schmidt","year":"1986","journal-title":"Th\u00e9se Universit\u00e9 Pierre et Marie Curie (Paris 6)"},{"key":"10.1016\/0304-3975(89)90064-9_BIB12","article-title":"Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes","author":"S\u00e9ebold","year":"1985","journal-title":"Th\u00e8se de 3i\u00e8me cycle"},{"key":"10.1016\/0304-3975(89)90064-9_BIB13","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"},{"key":"10.1016\/0304-3975(89)90064-9_BIB14","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. I. Mat. Nat. Kl. Christiania"},{"issue":"161","key":"10.1016\/0304-3975(89)90064-9_BIB15","article-title":"Blocking sets of terms","volume":"119","author":"Zimin","year":"1982","journal-title":"Matem. Sbornik"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:09Z","timestamp":1555077369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0304397589900649"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90064-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}