{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:48:46Z","timestamp":1648950526272},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00324-3","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"853-859","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1\u2286R\u2286R2 for given regular languages R1,R2"],"prefix":"10.1016","volume":"289","author":[{"given":"Kosaburo","family":"Hashiguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00324-3_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0019-9958(82)91028-2","article-title":"Regular languages of star height one","volume":"53","author":"Hashiguchi","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00324-3_BIB2","doi-asserted-by":"crossref","unstructured":"K. Hashiguchi, Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language, Proc. 18th Internat. Coll. on Automata, Languages and Programming, 1991, Lecture Notes in Computer Science, Vol. 510, Springer, Berlin, 1991, pp. 641\u2013648.","DOI":"10.1007\/3-540-54233-7_170"},{"key":"10.1016\/S0304-3975(01)00324-3_BIB3","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0207042","article-title":"The unsolvability of the equivalence problem for \u03b5-free NGSM's with unary input (output) alphabet and applications","volume":"7","author":"Ibarra","year":"1973","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:57:15Z","timestamp":1583776635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003243"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00324-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}