{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:53:37Z","timestamp":1757627617781,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90045-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"39-53","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-repetitive words relative to a rewriting system"],"prefix":"10.1016","volume":"72","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[]},{"given":"Aldo","family":"de Luca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90045-J_BIB1","first-page":"14","article-title":"Some recent results on square-free words","volume":"166","author":"Berstel","year":"1984"},{"key":"10.1016\/0304-3975(90)90045-J_BIB2","first-page":"205","article-title":"An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages","volume":"118","author":"Bertoni","year":"1981"},{"key":"10.1016\/0304-3975(90)90045-J_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(84)90160-2","article-title":"Almost all one-rule Thue systems have decidable word problems","volume":"49","author":"Book","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(90)90045-J_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(86)90056-6","article-title":"Square-free words on partially commutative free-monoids","volume":"22","author":"Carpi","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90045-J_BIB5","article-title":"Probl\u00e8mes Combinatoires de Commutation et R\u00e9arrangements","volume":"85","author":"Cartier","year":"1969"},{"key":"10.1016\/0304-3975(90)90045-J_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","article-title":"Sur la reconnaissabilit\u00e9 dans les mono\u00efdes partiellement commutatifs libres","volume":"19","author":"Cori","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(90)90045-J_BIB7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.2307\/2313498","article-title":"A sequence without repeats on x, x-1, y, y-1","volume":"72","author":"Dean","year":"1965","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(90)90045-J_BIB8","article-title":"Combinatorics on Words","volume":"17","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(90)90045-J_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 in semigroups","volume":"11","author":"Morse","year":"1944","journal-title":"Duke Math. J."},{"key":"10.1016\/0304-3975(90)90045-J_BIB10","first-page":"1","article-title":"\u00dcber die gegenseitige Lage glelcher 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:030439759090045J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090045J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:16Z","timestamp":1757477896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090045J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090045J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90045-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Non-repetitive words relative to a rewriting system","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90045-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}