{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:28Z","timestamp":1725490228809},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_37","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"421-431","source":"Crossref","is-referenced-by-count":9,"title":["Note on Minimal Finite Automata"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"M. Chrobak: Finite automata and unary languages. Theoretical Computer Science 47(1986), 149\u2013158","journal-title":"Theoretical Computer Science"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d: Communication Complexity and Parallel Computing. Springer 1997","DOI":"10.1007\/978-3-662-03442-2"},{"key":"37_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-45022-X_17","volume-title":"ICALP\u201900","author":"J. Hromkovi\u010d","year":"2000","unstructured":"J. Hromkovi\u010d, J. Karhum\u00e4ki, H. Klauck, S. Seibert, G. Schnitger: Measures on nondeterminism in finite automata. In: ICALP\u201900, Lecture Notes in Computer Science 1853, Springer-Verlag 2000, pp. 199\u2013210"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K. Iwama","year":"2000","unstructured":"K. Iwama, Y. Kambayashi and K. Takaki: Tight bounds on the number of states of DFA\u2019s that are equivalent to n-state NFA\u2019s. Theoretical Computer Science 237(2000) 485\u2013494","journal-title":"Theoretical Computer Science"},{"key":"37_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-44612-5_39","volume-title":"Proc. MFCS\u201900","author":"K. Iwama","year":"2000","unstructured":"K. Iwama. A. Matsuura and M. Paterson: A family of NFA\u2019s which need 2n-\u03b1 deterministic states. Proc. MFCS\u201900, Lecture Notes in Computer Science 1893, Springer-Verlag 2000, pp. 436\u2013445"},{"key":"37_CR6","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: On the bounds for state-set size in proofs of equivalence between deterministic, nondeterministic and two-way finite automata. IEEE Trans. Comput. C-20, pp. 1211\u20131214, 1971","journal-title":"IEEE Trans. Comput."},{"key":"37_CR7","first-page":"329","volume-title":"Probleme der Kybernetik","author":"O. B. Lupanov","year":"1966","unstructured":"O. B. Lupanov: Uber der Vergleich zweier Typen endlicher Quellem. Probleme der Kybernetik, Vol. 6, pp. 329\u2013335, Akademie-Verlag, Berlin, 1966"},{"key":"37_CR8","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: Finite automata and their decision problems. IBM J. Res. Develop, 3, pp. 114\u2013129, 1959","journal-title":"IBM J. Res. Develop"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:28Z","timestamp":1556818048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}