{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:09:21Z","timestamp":1649156961844},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> Hyper-minimization is a recent automaton compression technique that can reduce the size of an automaton beyond the limits imposed by classical minimization. The additional compression power is enabled by allowing a finite difference in the represented language. The necessary theory for hyper-minimization is developed for (bottom-up) deterministic tree automata. The hyper-minimization problem for deterministic tree automata is reduced to the hyper-minimization problem for deterministic finite-state string automata, for which fast algorithms exist. The fastest algorithm obtained in this way runs in time [Formula: see text], where m is the size of the transition table and n is the number of states of the input tree automaton. <\/jats:p>","DOI":"10.1142\/s0129054113400200","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T08:17:54Z","timestamp":1388132274000},"page":"815-830","source":"Crossref","is-referenced-by-count":2,"title":["HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA"],"prefix":"10.1142","volume":"24","author":[{"given":"ARTUR","family":"JE\u017b","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDREAS","family":"MALETTI","sequence":"additional","affiliation":[{"name":"Institute for Natural Language Processing, Universit\u00e4t Stuttgart Pfaffenwaldring 5b, 70569 Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410900684X"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2007061"},{"key":"p_4","first-page":"356","volume":"5734","author":"Gawrychowski P.","year":"2009","journal-title":"LNCS"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.022"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.029"},{"key":"p_11","first-page":"217","volume":"7381","author":"Je\u017c A.","year":"2012","journal-title":"LNCS"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/s10590-008-9039-0"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.01.004"},{"issue":"2","key":"p_17","first-page":"269","volume":"23","author":"Mohri M.","year":"1997","journal-title":"Comput. Linguist."},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:10:44Z","timestamp":1565122244000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":12,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400200"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400200","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}