{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:28:37Z","timestamp":1725460117889},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_19","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T03:47:55Z","timestamp":1345866475000},"page":"217-228","source":"Crossref","is-referenced-by-count":1,"title":["Hyper-minimization for Deterministic Tree Automata"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","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 2). Int. J. Found. Comput. Sci.\u00a020(4), 735\u2013746 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"19_CR2","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":"19_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata: Techniques and applications (2007), http:\/\/tata.gforge.inria.fr\/"},{"key":"19_CR4","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":"19_CR5","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, ch. 1, pp. 1\u201368. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"37","key":"19_CR7","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"J. H\u00f6gberg","year":"2009","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theoret. Comput. Sci.\u00a0410(37), 3539\u20133552 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"38-39","key":"19_CR8","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. Theoret. Comput. Sci.\u00a0411(38-39), 3404\u20133413 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Hosoya, H.: Foundations of XML Processing: The Tree-Automata Approach. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511762093"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10590-008-9039-0","volume":"21","author":"K. Knight","year":"2007","unstructured":"Knight, K.: Capturing practical natural language transformations. Machine Translation\u00a021(2), 121\u2013133 (2007)","journal-title":"Machine Translation"},{"key":"19_CR12","unstructured":"Maletti, A.: Notes on hyper-minimization. In: Proc. 13th Int. Conf. Automata and Formal Languages, pp. 34\u201349. Ny\u00edregyh\u00e1za College (2011)"},{"key":"19_CR13","unstructured":"Maletti, A., Quernheim, D.: Hyper-minimisation of deterministic weighted finite automata over semifields. In: Proc. 13th Int. Conf. Automata and Formal Languages, pp. 285\u2013299. Ny\u00edregyh\u00e1za College (2011)"},{"issue":"8","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1142\/S0129054111009094","volume":"22","author":"A. Maletti","year":"2011","unstructured":"Maletti, A., Quernheim, D.: Optimal hyper-minimization. Int. J. Found. Comput. Sci.\u00a022(8), 1877\u20131891 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR15","unstructured":"Schewe, S.: Beyond hyper-minimisation \u2014 minimising DBAs and DPAs is NP-complete. In: Proc. 30th Int. Conf. Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol.\u00a08, pp. 400\u2013411. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch. 2, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T08:33:18Z","timestamp":1687681998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}