{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:21:13Z","timestamp":1709828473066},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"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,5]]},"DOI":"10.1016\/s0304-3975(02)00891-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"451-462","source":"Crossref","is-referenced-by-count":24,"title":["A family of NFAs which need 2n\u2212\u03b1 deterministic states"],"prefix":"10.1016","volume":"301","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Akihiro","family":"Matsuura","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00891-5_BIB1","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(02)00891-5_BIB2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","article-title":"Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs","volume":"237","author":"Iwama","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00891-5_BIB3","doi-asserted-by":"crossref","unstructured":"G. Jir\u00e1skov\u00e1, Note on minimal finite automata, Proc. 26th Internat. Symp. Mathematical Foundations of Computer Science (MFCS2001), Bratislava, 2000, Lecture Notes in Computer Science, Vol. 2136, 2001, pp. 421\u2013431.","DOI":"10.1007\/3-540-44683-4_37"},{"key":"10.1016\/S0304-3975(02)00891-5_BIB4","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/S0304-3975(02)00891-5_BIB5","unstructured":"O.B. Lupanov, Uber den Vergleich zweier Typen endlicher Quellen, Probleme der Kybernetik, Vol. 6, Akademie-Verlag, Berlin, 1966, pp. 329\u2013335."},{"key":"10.1016\/S0304-3975(02)00891-5_BIB6","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","article-title":"On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata","volume":"C-20","author":"Moore","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(02)00891-5_BIB7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0304-3975(02)00891-5_BIB8","series-title":"Computation and Automata","author":"Salomaa","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008915?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008915?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T06:50:54Z","timestamp":1554015054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397502008915"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00891-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}