{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:26:42Z","timestamp":1778038002981,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642180972","type":"print"},{"value":"9783642180989","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_34","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"321-330","source":"Crossref","is-referenced-by-count":5,"title":["Simulations of Weighted Tree Automata"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_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)"},{"issue":"4","key":"34_CR2","first-page":"449","volume":"23","author":"A. Alexandrakis","year":"1989","unstructured":"Alexandrakis, A., Bozapalidis, S.: Repr\u00e9sentations matricielles des s\u00e9ries d\u2019arbre reconnaissables. Informatique Th\u00e9orique et Applications\u00a023(4), 449\u2013459 (1989)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11523468_33","volume-title":"Automata, Languages and Programming","author":"M.P. B\u00e9al","year":"2005","unstructured":"B\u00e9al, M.P., Lombardy, S., Sakarovitch, J.: On the equivalence of \u2124-automata. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 397\u2013409. Springer, Heidelberg (2005)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11753728_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.P. B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.P., Lombardy, S., Sakarovitch, J.: Conjugacy and equivalence of weighted automata and functional transducers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 58\u201369. Springer, Heidelberg (2006)"},{"key":"34_CR5","series-title":"EATCS Monographs on Theoret. Comput. Sci.","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1984","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoret. Comput. Sci., vol.\u00a012. Springer, Heidelberg (1984)"},{"key":"34_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories: The Equational Logic of Iterative Processes","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories: The Equational Logic of Iterative Processes. Springer, Heidelberg (1993)"},{"issue":"2","key":"34_CR7","first-page":"145","volume":"8","author":"S.L. Bloom","year":"2003","unstructured":"Bloom, S.L., \u00c9sik, Z.: An extension theorem with an application to formal tree series. J. Autom. Lang. Combin.\u00a08(2), 145\u2013185 (2003)","journal-title":"J. Autom. Lang. Combin."},{"issue":"4","key":"34_CR8","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."},{"issue":"1-3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2007.11.018","volume":"393","author":"P. Buchholz","year":"2008","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata. Theoret. Comput. Sci.\u00a0393(1-3), 109\u2013123 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Cleophas, L.: Forest FIRE and FIRE wood: Tools for tree automata and tree algorithms. In: FSMNLP, pp. 191\u2013198 (2008)","DOI":"10.1007\/978-3-642-02979-0_29"},{"key":"34_CR11","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, London (1974)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0028581","volume-title":"STACS 1998","author":"Z. \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 455\u2013465. Springer, Heidelberg (1998)"},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jlap.2009.10.001","volume":"79","author":"Z. \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages. J. Log. Algebr. Program.\u00a079(2), 189\u2013213 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"34_CR14","series-title":"EATCS Monographs on Theoret. Comput. Sci.","first-page":"29","volume-title":"Handbook of Weighted Automata","author":"Z. \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: Fixed point theory. In: Handbook of Weighted Automata. EATCS Monographs on Theoret. Comput. Sci., pp. 29\u201366. Springer, Heidelberg (2010)"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/9789812810908_0008","volume-title":"Words, Semigroups, and Transductions","author":"Z. \u00c9sik","year":"2001","unstructured":"\u00c9sik, Z., Kuich, W.: A generation of Kozen\u2019s axiomatization of the equational theory of the regular sets. In: Words, Semigroups, and Transductions, pp. 99\u2013114. World Scientific, Singapore (2001)"},{"key":"34_CR16","unstructured":"\u00c9sik, Z., Maletti, A.: Simulation vs. equivalence. In: FCS, pp. 119\u2013122. CSREA Press (2010) (preprint), http:\/\/arxiv.org\/abs\/1004.2426 )"},{"key":"34_CR17","doi-asserted-by":"crossref","DOI":"10.1142\/3903","volume-title":"Semirings\u2014Algebraic Theory and Applications in Computer Science","author":"U. Hebisch","year":"1998","unstructured":"Hebisch, U., Weinert, H.J.: Semirings\u2014Algebraic Theory and Applications in Computer Science. World Scientific, Singapore (1998)"},{"key":"34_CR18","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":"3","key":"34_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.tcs.2004.01.020","volume":"318","author":"G. Karner","year":"2004","unstructured":"Karner, G.: Continuous monoids and semirings. Theoret. Comput. Sci.\u00a0318(3), 355\u2013372 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR20","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual (2001)"},{"key":"34_CR21","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)"},{"issue":"2","key":"34_CR22","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inform. and Comput.\u00a0110(2), 366\u2013390 (1994)","journal-title":"Inform. and Comput."},{"key":"34_CR23","volume-title":"Algebra","author":"S. Lang","year":"1984","unstructured":"Lang, S.: Algebra, 2nd edn. Addison Wesley, Reading (1984)","edition":"2"},{"key":"34_CR24","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":"34_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)"},{"key":"34_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"}],"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-18098-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T14:57:48Z","timestamp":1637247468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}