{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:06Z","timestamp":1725536826054},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_31","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"356-368","source":"Crossref","is-referenced-by-count":11,"title":["Hyper-minimisation Made Efficient"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]},{"given":"Artur","family":"Je\u017c","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1236457.1236460","volume":"54","author":"A. Andersson","year":"2007","unstructured":"Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM\u00a054(3), 13 (2007)","journal-title":"J. ACM"},{"key":"31_CR2","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 $\\mathcal{O}(n^2$ ). In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 223\u2013231. Springer, Heidelberg (2008)"},{"issue":"1","key":"31_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 - Theoretical Informatics and Applications\u00a043(1), 69\u201394 (2009)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"1-2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci.\u00a0267(1-2), 3\u201316 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Hopcroft\u2019s algorithm and cyclic automata, pp. 172\u2013183 (2008)","DOI":"10.1007\/978-3-540-88282-4_17"},{"issue":"4","key":"31_CR6","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput.\u00a023(4), 738\u2013761 (1994)","journal-title":"SIAM J. Comput."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D. Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Informatica\u00a02, 97\u2013109 (1973)","journal-title":"Acta Informatica"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Holzer, M., Maletti, A.: An n log n algorithm for hyper-minimizing states in a (minimized) deterministic automaton. In: CIAA, pp. 4\u201313 (2009)","DOI":"10.1007\/978-3-642-02979-0_4"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An n logn algorithm for minimizing states in a finite automaton. Technical Report, CS-190 (1970)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44977-9_11","volume-title":"Implementation and Application of Automata","author":"H. K\u00f6rner","year":"2003","unstructured":"K\u00f6rner, H.: On minimizing cover automata for finite languages in $\\mathcal{O}(n \\log n)$ time. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 117\u2013127. Springer, Heidelberg (2003)"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms\u00a051(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"31_CR12","series-title":"Dagstuhl Seminar Proceedings","first-page":"645","volume-title":"STACS","author":"A. Valmari","year":"2008","unstructured":"Valmari, A., Lehtinen, P.: Efficient minimization of DFAs with partial transition. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol.\u00a008001, pp. 645\u2013656. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl (2008)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:34:02Z","timestamp":1558492442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}