{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:17:57Z","timestamp":1740374277682,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146831"},{"type":"electronic","value":"9783642146848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14684-8_7","type":"book-chapter","created":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T11:52:18Z","timestamp":1279972338000},"page":"56-68","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing Weighted Tree Grammars Using Simulation"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"volume-title":"Handbook of Natural Language Processing","year":"2000","key":"7_CR1","unstructured":"Dale, R., Moisl, H., Somers, H.L. (eds.): Handbook of Natural Language Processing. CRC Press, Boca Raton (2000)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-45657-0_47","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2002","unstructured":"Abdulla, P.A., Jonsson, B., Mahata, P., d\u2019Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 555\u2013568. Springer, Heidelberg (2002)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30586-6_1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"7_CR4","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual. BRICS, Department of Computer Science, University of Aarhus (2001)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11812128_11","volume-title":"Implementation and Application of Automata","author":"J. May","year":"2006","unstructured":"May, J., Knight, K.: Tiburon: A weighted tree automata toolkit. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 102\u2013113. Springer, Heidelberg (2006)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cleophas, L.: Forest FIRE and FIRE wood: Tools for tree automata and tree algorithms. In: Proc. FSMNLP, pp. 191\u2013198 (2008)","DOI":"10.3233\/978-1-58603-975-2-191"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci.\u00a018(2), 115\u2013148 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR8","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Combin.\u00a08(2), 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"7_CR9","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universit\u00e4t Dresden (2005)"},{"key":"7_CR10","first-page":"189","volume-title":"An n logn algorithm for minimizing states in a finite automaton. 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. Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-76336-9_12","volume-title":"Implementation and Application of Automata","author":"J. H\u00f6gberg","year":"2007","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimisation of tree automata. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 109\u2013121. Springer, Heidelberg (2007)"},{"issue":"11","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1016\/j.ic.2009.01.004","volume":"207","author":"A. Maletti","year":"2009","unstructured":"Maletti, A.: Minimizing deterministic weighted tree automata. Inform. and Comput.\u00a0207(11), 1284\u20131299 (2009)","journal-title":"Inform. and Comput."},{"key":"7_CR13","first-page":"125","volume-title":"Proc. FOCS","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. FOCS, pp. 125\u2013129. IEEE Computer Society, Los Alamitos (1972)"},{"issue":"6","key":"7_CR14","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.jcss.2006.11.002","volume":"73","author":"G. Gramlich","year":"2007","unstructured":"Gramlich, G., Schnitger, G.: Minimizing nfa\u2019s and regular expressions. J. Comput. System Sci.\u00a073(6), 908\u2013923 (2007)","journal-title":"J. Comput. System Sci."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-73208-2_21","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P\u2009\u2260\u2009NP. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 205\u2013216. Springer, Heidelberg (2007)"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1142\/S0129054107004929","volume":"18","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., H\u00f6gberg, J., Kaati, L.: Bisimulation minimization of tree automata. Int. J. Found. Comput. Sci.\u00a018(4), 699\u2013713 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-78800-3_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Computing simulations over tree automata. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 93\u2013108. Springer, Heidelberg (2008)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-642-03564-7_19","volume-title":"CAI 2009","author":"A. Maletti","year":"2009","unstructured":"Maletti, A.: A backward and a forward simulation for weighted tree automata. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 288\u2013304. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(83)90100-7","volume":"27","author":"S. Bozapalidis","year":"1983","unstructured":"Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci.\u00a027(1-2), 211\u2013215 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01893886","volume":"28","author":"S. Bozapalidis","year":"1991","unstructured":"Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inform.\u00a028(4), 351\u2013363 (1991)","journal-title":"Acta Inform."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-73208-2_23","volume-title":"Developments in Language Theory","author":"J. H\u00f6gberg","year":"2007","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Bisimulation minimisation for weighted tree automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 229\u2013241. Springer, Heidelberg (2007)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Huang, L., Chiang, D.: Better k-best parsing. In: Proc. IWPT, pp. 53\u201364 (2005)","DOI":"10.3115\/1654494.1654500"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(87)90190-6","volume":"24","author":"A. Alexandrakis","year":"1987","unstructured":"Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene\u2019s theorem. Information Processing Letters\u00a024(1), 1\u20134 (1987)","journal-title":"Information Processing Letters"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems\u00a032(1), 1\u201333 (1999)","journal-title":"Theory Comput. Systems"},{"issue":"3","key":"7_CR25","first-page":"417","volume":"8","author":"B. Borchardt","year":"2003","unstructured":"Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Combin.\u00a08(3), 417\u2013463 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Hol\u00edk, L., Kaati, L., Vojnar, T.: A uniform (bi-)simulation-based framework for reducing tree automata. In: Proc. MEMICS, pp. 3\u201311 (2008)","DOI":"10.1016\/j.entcs.2009.08.026"}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14684-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T09:30:37Z","timestamp":1740303037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14684-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146831","9783642146848"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14684-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}