{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:13:58Z","timestamp":1649027638574},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"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":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00064-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"743-749","source":"Crossref","is-referenced-by-count":1,"title":["Regular component decomposition of regular languages"],"prefix":"10.1016","volume":"299","author":[{"given":"Y.J.","family":"Liu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00064-6_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(02)00064-6_BIB2","unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974."},{"key":"10.1016\/S0304-3975(02)00064-6_BIB3","series-title":"Lecture Notes","article-title":"Free Monoids and Languages","author":"Shyr","year":"1991"},{"issue":"3","key":"10.1016\/S0304-3975(02)00064-6_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1006586923902","article-title":"Regular component splittable languages","volume":"78","author":"Shyr","year":"1998","journal-title":"Acta Math. Hung."},{"key":"10.1016\/S0304-3975(02)00064-6_BIB5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0166-218X(97)86751-0","article-title":"The single loop representations of regular languages","volume":"82","author":"Shyr","year":"1998","journal-title":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:20:36Z","timestamp":1556713236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502000646"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00064-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}