{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:56:48Z","timestamp":1740095808358,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"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-03564-7_19","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T07:05:35Z","timestamp":1250751935000},"page":"288-304","source":"Crossref","is-referenced-by-count":3,"title":["A Backward and a Forward Simulation for Weighted Tree Automata"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","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":"19_CR2","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":"19_CR3","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":"19_CR4","doi-asserted-by":"crossref","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theoret. Comput. Sci. (to appear, 2009), http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.03.022","DOI":"10.1016\/j.tcs.2009.03.022"},{"key":"19_CR5","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 Press, Los Alamitos (1972)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-31856-9_33","volume-title":"STACS 2005","author":"G. Gramlich","year":"2005","unstructured":"Gramlich, G., Schnitger, G.: Minimizing nFA\u2019s and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 399\u2013411. Springer, Heidelberg (2005)"},{"issue":"6","key":"19_CR7","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":"19_CR8","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 \u2260 NP. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 205\u2013216. Springer, Heidelberg (2007)"},{"issue":"4","key":"19_CR9","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":"19_CR10","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":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-70844-5_22","volume-title":"Implementation and Applications of Automata","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Composed bisimulation for tree automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 212\u2013222. Springer, Heidelberg (2008)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Maletti, A.: Minimizing deterministic weighted tree automata. Inform. and Comput. (to appear, 2009), http:\/\/dx.doi.org\/10.1016\/j.ic.2009.01.004","DOI":"10.1016\/j.ic.2009.01.004"},{"key":"19_CR13","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)"},{"issue":"2","key":"19_CR14","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":"1","key":"19_CR15","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":"19_CR16","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":"19_CR17","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universit\u00e4t Dresden (2005)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Bisimulation minimisation of weighted tree automata. Technical Report ISI-TR-634, University of Southern California (2007)","DOI":"10.1007\/978-3-540-73208-2_23"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T11:36:53Z","timestamp":1685101013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}