{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:52:55Z","timestamp":1784227975678,"version":"3.55.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00095-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"75-77","source":"Crossref","is-referenced-by-count":96,"title":["A lower bound technique for the size of nondeterministic finite automata"],"prefix":"10.1016","volume":"59","author":[{"given":"Ian","family":"Glaister","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00095-6_BIB1","first-page":"166","article-title":"A note about minimal non-deterministic automata","volume":"47","author":"Arnold","year":"1992","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00095-6_BIB2","series-title":"Automaticity III: Polynomial automaticity, context-free languages, and fixed points of morphisms","author":"Glaister","year":"1995"},{"key":"10.1016\/0020-0190(96)00095-6_BIB3","series-title":"Proc. of MFCS '96","article-title":"Polynomial automaticity, context-free languages and fixed points of morphisms","author":"Glaister","year":"1996"},{"key":"10.1016\/0020-0190(96)00095-6_BIB4","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(96)00095-6_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/S012905419100011X","article-title":"The structure and complexity of minimal NFA's over a unary alphabet","volume":"2","author":"Jiang","year":"1991","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00095-6_BIB6","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1137\/0222067","article-title":"NFA minimization problems are hard","volume":"22","author":"Jiang","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00095-6_BIB7","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/T-C.1970.222994","article-title":"On the state minimization of nondeterministic finite automata","volume":"19","author":"Kameda","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(96)00095-6_BIB8","article-title":"State minimization of nondeterministic machines","author":"Kim","year":"1974"},{"key":"10.1016\/0020-0190(96)00095-6_BIB9","series-title":"Proc. of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems","first-page":"74","article-title":"Computing small nondeterministic finite automata","author":"Matz","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000956?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:13Z","timestamp":1556058253000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000956"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00095-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}