{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:24:45Z","timestamp":1767911085026,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0304-3975(90)90163-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"81-89","source":"Crossref","is-referenced-by-count":7,"title":["Factorizations of free monoids and unavoidable regularities"],"prefix":"10.1016","volume":"73","author":[{"given":"Stefano","family":"Varricchio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90163-C_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(90)90163-C_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1971.36.285","article-title":"An interesting combinatorial method in the theory of locally finite semigroups","volume":"36","author":"Brown","year":"1971","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(90)90163-C_BIB3","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"issue":"4","key":"10.1016\/0304-3975(90)90163-C_BIB4","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1051\/ita\/1987210404371","article-title":"Codes limites et factorisations finies du monoide libre","volume":"21","author":"Krob","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"2","key":"10.1016\/0304-3975(90)90163-C_BIB5","first-page":"237","article-title":"Mots de Lyndon et un th\u00e9or\u00e9me de Shirshov","volume":"10","author":"Reutenauer","year":"1986","journal-title":"Ann. Sci. Math. Qu\u00e9bec"},{"key":"10.1016\/0304-3975(90)90163-C_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2033993","article-title":"On a factorization of free monoids","volume":"16","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90163-C_BIB7","first-page":"538","article-title":"Bisections of free monoids and a new unavoidable regularity","volume":"324","author":"Varricchio","year":"1988"},{"key":"10.1016\/0304-3975(90)90163-C_BIB8","series-title":"Th\u00e9se d'\u00e9tat","article-title":"Alg\u00e9bres de Lie libres et mono\u00efdes libres","author":"Viennot","year":"1974"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090163C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090163C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:34Z","timestamp":1555113094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090163C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["030439759090163C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90163-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}