{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:35Z","timestamp":1725483755493},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_39","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"436-445","source":"Crossref","is-referenced-by-count":3,"title":["A Family of NFA\u2019s Which Need 2n \u2014 \u03b1 Deterministic States"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Akihiro","family":"Matsuura","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"M. Rabin and D. Scott, \u201cFinite automata and their decision problems,\u201d IBM J. Res. Develop. 3, pp. 114\u2013125, 1959.","journal-title":"IBM J. Res. Develop"},{"key":"39_CR2","first-page":"329","volume-title":"Probleme der Kybernetik","author":"O. B. Lupanov","year":"1966","unstructured":"O. B. Lupanov, \u201cUber den Vergleich zweier Typen endlicher Quellen,\u201d Probleme der Kybernetik, Vol. 6, pp. 329\u2013335, Akademie-Verlag, Berlin, 1966."},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"C-20","author":"F. Moore","year":"1971","unstructured":"F. Moore, \u201cOn the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata,\u201d IEEE Trans. Comput. C-20, pp. 1211\u20131214, 1971.","journal-title":"IEEE Trans. Comput."},{"key":"39_CR4","unstructured":"J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley, 1979."},{"key":"39_CR5","unstructured":"K. Iwama, Y. Kambayashi, and K. Takaki, \u201cTight bounds on the number of states of DFA\u2019s that are equivalent to n-state NFA\u2019s,\u201d Theoretical Computer Science, to appear. (\n                    http:\/\/www.lab2.kuis.kyoto-u.ac.jp\/iwama\/NfaDfa.ps\n                    \n                  )"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T12:37:28Z","timestamp":1547728648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}