{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:19:42Z","timestamp":1733548782930,"version":"3.30.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0020-0190(97)00080-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"289-294","source":"Crossref","is-referenced-by-count":1,"title":["On some factorizations of infinite words by elements of codes"],"prefix":"10.1016","volume":"62","author":[{"given":"J.","family":"Justin","sequence":"first","affiliation":[]},{"given":"G.","family":"Pirillo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00080-X_BIB1","series-title":"Developments in Language Theory II","article-title":"Recent results in sturmian words","author":"Berstel","year":"1966"},{"year":"1985","series-title":"Theory of Codes","author":"Berstel","key":"10.1016\/S0020-0190(97)00080-X_BIB2"},{"year":"1975","series-title":"Graph Theory an Algorithmic Approach","author":"Christofides","key":"10.1016\/S0020-0190(97)00080-X_BIB3"},{"key":"10.1016\/S0020-0190(97)00080-X_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/00150517.1993.12429287","article-title":"Symmetric Fibonacci words","volume":"31","author":"Chuan","year":"1993","journal-title":"Fibonacci Quarterly"},{"key":"10.1016\/S0020-0190(97)00080-X_BIB5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(95)00067-M","article-title":"A division property of the Fibonacci word","volume":"54","author":"de Luca","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00080-X_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(95)00080-V","article-title":"Palindromes in the Fibonacci word","volume":"55","author":"Droubay","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0020-0190(97)00080-X_BIB7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","article-title":"Outfix and infix codes and related classes of languages","volume":"43","author":"Ito","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00080-X_BIB8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(96)00147-0","article-title":"Viennot factorizations of infinite words","volume":"60","author":"Melan\u00e7on","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00080-X_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0001-8708(91)90069-J","article-title":"Shirshov's theorem and \u03c9-permutability of semigroups","volume":"87","author":"Justin","year":"1991","journal-title":"Adv. in Math."},{"issue":"3","key":"10.1016\/S0020-0190(97)00080-X_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1142\/S0218196793000202","article-title":"Factorial languages and some combinatorial properties of semigroups","volume":"3","author":"Justin","year":"1993","journal-title":"Internat. J. Algebra Comput."},{"year":"1983","series-title":"Combinatorics on Words","author":"Lothaire","key":"10.1016\/S0020-0190(97)00080-X_BIB11"},{"key":"10.1016\/S0020-0190(97)00080-X_BIB12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(94)00053-0","article-title":"Infinite words and biprefix codes","volume":"50","author":"Pirillo","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00080-X_BIB13","series-title":"Kokyuroku 910 \u201cSemigroups, Formal Languages and Combinatorics on Words\u201d","article-title":"Some remarks on the Fibonacci infinite word","author":"Pirillo","year":"1994"},{"key":"10.1016\/S0020-0190(97)00080-X_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(90)90163-C","article-title":"Factorization of free monoids and unavoidable regularities","volume":"73","author":"Varricchio","year":"1990","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700080X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700080X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T21:13:25Z","timestamp":1733519605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909700080X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S002001909700080X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00080-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}