{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:51:08Z","timestamp":1743036668814,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_22","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"201-210","source":"Crossref","is-referenced-by-count":1,"title":["Better Hyper-minimization"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-70844-5_23","volume-title":"Implementation and Applications of Automata","author":"A. Badr","year":"2008","unstructured":"Badr, A.: Hyper-minimization in O(n\n                2). In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 223\u2013231. Springer, Heidelberg (2008)"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1142\/S012905410900684X","volume":"20","author":"A. Badr","year":"2009","unstructured":"Badr, A.: Hyper-minimization in O(n\n                2). Int. J. Found. Comput. Sci.\u00a020(4), 735\u2013746 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2007061","volume":"43","author":"A. Badr","year":"2009","unstructured":"Badr, A., Geffert, V., Shipman, I.: Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl.\u00a043(1), 69\u201394 (2009)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"22_CR4","unstructured":"Eppstein, D.: Finding common ancestors and disjoint paths in DAGs. Tech. Rep. 95-52, University of California, Irvine (1995)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-03816-7_31","volume-title":"Mathematical Foundations of Computer Science 2009","author":"P. Gawrychowski","year":"2009","unstructured":"Gawrychowski, P., Je\u017c, A.: Hyper-minimisation made efficient. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 356\u2013368. Springer, Heidelberg (2009)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-02979-0_4","volume-title":"Implementation and Application of Automata","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Maletti, A.: An n logn algorithm for hyper-minimizing states in a (minimized) deterministic automaton. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 4\u201313. Springer, Heidelberg (2009)"},{"issue":"38\u201339","key":"22_CR7","doi-asserted-by":"publisher","first-page":"3404","DOI":"10.1016\/j.tcs.2010.05.029","volume":"411","author":"M. Holzer","year":"2010","unstructured":"Holzer, M., Maletti, A.: An n logn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci.\u00a0411(38\u201339), 3404\u20133413 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"22_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2007","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison Wesley, Reading (2007)","edition":"3"},{"issue":"6","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput.\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"22_CR11","series-title":"Monographs on Linguistic Analysis","doi-asserted-by":"crossref","DOI":"10.1515\/9783110876000","volume-title":"Formal Aspects of Phonological Description","author":"C.D. Johnson","year":"1972","unstructured":"Johnson, C.D.: Formal Aspects of Phonological Description. Monographs on Linguistic Analysis, vol.\u00a03. Mouton, The Hague (1972)"},{"key":"22_CR12","first-page":"188","volume-title":"Proc. 12th IEEE Annual Symp. Switching and Automata Theory","author":"A.R. Meyer","year":"1971","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proc. 12th IEEE Annual Symp. Switching and Automata Theory, pp. 188\u2013191. IEEE Computer Society Press, Los Alamitos (1971)"},{"issue":"2","key":"22_CR13","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist.\u00a023(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"issue":"10","key":"22_CR14","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"20","author":"F.R. Moore","year":"1971","unstructured":"Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Computers\u00a020(10), 1211\u20131214 (1971)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev.\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM J. Res. Dev."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:26:57Z","timestamp":1578533217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_22"}},"subtitle":["Not as Fast, But Fewer Errors"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}