{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:07:24Z","timestamp":1648627644447},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T00:00:00Z","timestamp":1323129600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00236-011-0148-5","type":"journal-article","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T15:48:48Z","timestamp":1323100128000},"page":"29-52","source":"Crossref","is-referenced-by-count":2,"title":["Equational weighted tree transformations"],"prefix":"10.1007","volume":"49","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]},{"given":"Zolt\u00e1n","family":"F\u00fcl\u00f6p","sequence":"additional","affiliation":[]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,6]]},"reference":[{"key":"148_CR1","doi-asserted-by":"crossref","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. Inf. Process. Lett. 24, 1\u20134 (1987)","journal-title":"Inf. Process. Lett."},{"key":"148_CR2","unstructured":"Arnold, A., Dauchet, M.: Bi-transductions de forets. In: Michaelson, S., Milner, R. (eds.) Proc. 3rd Int. Coll. Automata, Languages, and Programming, pp. 74\u201386. Edinburgh University Press, Edinburgh (1976)"},{"key":"148_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","volume":"20","author":"A. Arnold","year":"1982","unstructured":"Arnold A., Dauchet M.: Morphismes et bimorphismes d\u2019arbes. Theor. Comput. Sci. 20, 33\u201393 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"148_CR4","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 18, 115\u2013148 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"148_CR5","volume-title":"Iteration Theories, Monographs in Theoretical Computer Science. An EATCS Series","author":"S.L. Bloom","year":"1993","unstructured":"Bloom S.L., \u00c9sik Z.: Iteration Theories, Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1993)"},{"key":"148_CR6","unstructured":"Borchardt, B.: The theory of recognizable tree series. Verlag f\u00fcr Wissenschaft und Forschung, Ph.D. thesis, 2004, TU Dresden, Germany (2005)"},{"key":"148_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF01893886","volume":"28","author":"S. Bozapalidis","year":"1991","unstructured":"Bozapalidis S.: Effective construction of the syntactic algebra of recognizable tree series. Acta Inf. 28, 351\u2013363 (1991)","journal-title":"Acta Inf."},{"key":"148_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1051\/ita\/1989230404491","volume":"23","author":"S. Bozapalidis","year":"1989","unstructured":"Bozapalidis S., Alexandrakis A.: Repr\u00e9sentations matricielles des s\u00e9ries d\u2019arbre reconnaissables. Theor. Inf. Appl. 23, 449\u2013459 (1989)","journal-title":"Theor. Inf. Appl."},{"key":"148_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis S.: Equational elements in additive algebras. Theory Comput. Syst. 32, 1\u201333 (1999)","journal-title":"Theory Comput. Syst."},{"key":"148_CR10","doi-asserted-by":"crossref","first-page":"3676","DOI":"10.1016\/j.tcs.2011.03.028","volume":"412","author":"S. Bozapalidis","year":"2011","unstructured":"Bozapalidis S., F\u00fcl\u00f6p Z., Rahonis G.: Equational tree transformations. Theor. Comput. Sci. 412, 3676\u20133692 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"148_CR11","first-page":"185","volume":"10","author":"S. Bozapalidis","year":"2005","unstructured":"Bozapalidis S., Rahonis G.: On the closure of recognizable tree series under tree homomorphisms. J. Autom. Lang. Comb. 10, 185\u2013202 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"148_CR12","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available at: http:\/\/tata.gforge.imria.fr\/ (2007)"},{"key":"148_CR13","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway J.H.: Regular Algebra and Finite Machines. Chapman & Hall, London (1971)"},{"key":"148_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"42","author":"B. Courcelle","year":"1986","unstructured":"Courcelle B.: Equivalences and transformations of regular systems\u2014applications to recursive program schemes and grammars. Theor. Comput. Sci. 42, 1\u2013122 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"148_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(95)00145-X","volume":"163","author":"B. Courcelle","year":"1996","unstructured":"Courcelle B.: Basic notions of universal algebra for language theory and graph grammars. Theor. Comput. Sci. 163, 1\u201354 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"148_CR16","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W.: Semirings and formal power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series, pp.3\u201328. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01492-5_1"},{"key":"148_CR17","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.ins.2009.09.003","volume":"180","author":"M. Droste","year":"2010","unstructured":"Droste M., St\u00fcber T., Vogler H.: Weighted finite automata over strong bimonoids. Inf. Sci. 180, 156\u2013166 (2010)","journal-title":"Inf. Sci."},{"key":"148_CR18","volume-title":"Automata, Languages and Machines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S.: Automata, Languages and Machines, vol. A. Academic Press, San Diego (1974)"},{"key":"148_CR19","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet J.: Bottom-up and top-down tree transformations\u2014a comparison. Math. Syst. Theory 9, 198\u2013231 (1975)","journal-title":"Math. Syst. Theory"},{"key":"148_CR20","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet J., Schmidt E.M.: IO and OI. I. J. Comput. Syst. Sci. 15, 328\u2013353 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"148_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","volume":"16","author":"J. Engelfriet","year":"1978","unstructured":"Engelfriet J., Schmidt E.M.: IO and OI. II. J. Comput. Syst. Sci. 16, 67\u201399 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"148_CR22","first-page":"11","volume":"7","author":"J. Engelfriet","year":"2002","unstructured":"Engelfriet J., F\u00fcl\u00f6p Z., Vogler H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7, 11\u201370 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"148_CR23","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik Z., Kuich W.: Formal tree series. J. Autom. Lang. Comb. 8, 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"148_CR24","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.fss.2007.02.016","volume":"158","author":"Z. \u00c9sik","year":"2007","unstructured":"\u00c9sik Z., Liu G.: Fuzzy tree automata. Fuzzy Sets Syst. 158, 1450\u20131460 (2007)","journal-title":"Fuzzy Sets Syst."},{"key":"148_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-575","volume":"112","author":"Z. F\u00fcl\u00f6p","year":"2011","unstructured":"F\u00fcl\u00f6p Z., Maletti A., Vogler H.: Backward and forward application of extended tree series transformations. Fundam. Inf. 112, 1\u201339 (2011)","journal-title":"Fundam. Inf."},{"key":"148_CR26","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, Monographs in Theoretical Computer Science, An EATCS Series, Springer, pp. 313\u2013404.(2009)","DOI":"10.1007\/978-3-642-01492-5_9"},{"key":"148_CR27","first-page":"31","volume":"9","author":"Z. F\u00fcl\u00f6p","year":"2004","unstructured":"F\u00fcl\u00f6p Z., Vogler H.: Weighted tree transducers. J. Autom. Lang. Comb. 9, 31\u201354 (2004)","journal-title":"J. Autom. Lang. Comb."},{"key":"148_CR28","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg F., Steinby M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"148_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of Formal Languages, vol. III","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg F., Steinby M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages, vol. III., pp. 1\u201368. Springer, Berlin (1997)"},{"key":"148_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their Applications","author":"J.S. Golan","year":"1999","unstructured":"Golan J.S.: Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"148_CR31","doi-asserted-by":"crossref","unstructured":"Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, Chap. 9, pp. 609\u2013677. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59136-5_9"},{"key":"148_CR32","unstructured":"Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) 3rd International Conference on Developments in Language Theory, DLT 1997, Thessaloniki, Greece, Proceedings, pp. 61\u2013101. Aristotle University of Thessaloniki (1998)"},{"key":"148_CR33","first-page":"135","volume":"14","author":"W. Kuich","year":"1999","unstructured":"Kuich W.: Tree transducers and formal tree series. Acta Cybernet. 14, 135\u2013149 (1999)","journal-title":"Acta Cybernet."},{"key":"148_CR34","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1142\/S012905410500325X","volume":"16","author":"A. Maletti","year":"2005","unstructured":"Maletti A.: Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. 16, 723\u2013741 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"148_CR35","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tcs.2006.08.026","volume":"366","author":"A. Maletti","year":"2006","unstructured":"Maletti A.: Compositions of tree series transformations. Theoret. Comput. Sci. 366, 248\u2013271 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"148_CR36","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.ic.2008.03.019","volume":"206","author":"A. Maletti","year":"2008","unstructured":"Maletti A.: Compositions of extended top-down tree transducers. Inf. Comput. 206, 1187\u20131196 (2008)","journal-title":"Inf. Comput."},{"key":"148_CR37","doi-asserted-by":"crossref","first-page":"223","DOI":"10.14232\/actacyb.20.2.2011.2","volume":"20","author":"A. Maletti","year":"2011","unstructured":"Maletti A.: Survey: Weighted extended top-down tree transducers part I\u2014basics and expressive power. Acta Cybernet. 20, 223\u2013250 (2011)","journal-title":"Acta Cybernet."},{"key":"148_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4962-7","volume-title":"Algebraic Approaches to Program Semantics","author":"E.G. Manes","year":"1986","unstructured":"Manes E.G., Arbib M.A.: Algebraic Approaches to Program Semantics. Springer, Berlin (1986)"},{"key":"148_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei J., Wright J.B.: Algebraic automata and context-free sets. Inf. Control. 11, 3\u201329 (1967)","journal-title":"Inf. Control."},{"key":"148_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-76771-5","volume-title":"Universal Algebra for Computer Scientists, EATCS Monographs on Theoretical Computer Science, vol. 25","author":"W. Wechler","year":"1992","unstructured":"Wechler W.: Universal Algebra for Computer Scientists, EATCS Monographs on Theoretical Computer Science, vol. 25. Springer, Berlin (1992)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0148-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-011-0148-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0148-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T07:20:10Z","timestamp":1593328810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-011-0148-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,6]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s00236-011-0148-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,6]]}}}