{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:25:07Z","timestamp":1780050307662,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354284","type":"print"},{"value":"9783540354307","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_20","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"215-225","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchies of Tree Series Transformations Revisited"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"135","volume":"14","author":"W. Kuich","year":"1999","unstructured":"Kuich, W.: Tree transducers and formal tree series. Acta Cybernet.\u00a014, 135\u2013149 (1999)","journal-title":"Acta Cybernet."},{"key":"20_CR2","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. Combin.\u00a07, 11\u201370 (2002)","journal-title":"J. Autom. Lang. Combin."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00224-003-1072-z","volume":"36","author":"Z. F\u00fcl\u00f6p","year":"2003","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Systems\u00a036, 247\u2013293 (2003)","journal-title":"Theory Comput. Systems"},{"key":"20_CR4","unstructured":"Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) Proc. 3rd Int. Conf. Develop. in Lang. Theory, pp. 61\u2013101. Aristotle University of Thessaloniki (1998)"},{"key":"20_CR5","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\u201333 (1999)","journal-title":"Theory Comput. Systems"},{"key":"20_CR6","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Combin.\u00a08, 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"20_CR7","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, 417\u2013463 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00224-004-1096-z","volume":"38","author":"M. Droste","year":"2005","unstructured":"Droste, M., Pech, C., Vogler, H.: A Kleene theorem for weighted tree automata. Theory Comput. Systems\u00a038, 1\u201338 (2005)","journal-title":"Theory Comput. Systems"},{"key":"20_CR9","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, 115\u2013148 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR10","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universit\u00e4t Dresden (2005)"},{"key":"20_CR11","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: Human Lang. Tech. Conf. of the North American Chapter of the Assoc. for Computational Linguistics, pp. 105\u2013112 (2004)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/0022-0000(82)90019-8","volume":"25","author":"J. Engelfriet","year":"1982","unstructured":"Engelfriet, J.: The copying power of one-state tree transducers. J. Comput. System Sci.\u00a025, 418\u2013435 (1982)","journal-title":"J. Comput. System Sci."},{"key":"20_CR13","volume-title":"Tree Automata and Languages","author":"J.-C. Raoult","year":"1992","unstructured":"Raoult, J.-C.: A survey of tree transductions. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages. Elsevier Science, Amsterdam (1992)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.tcs.2004.01.001","volume":"314","author":"Z. F\u00fcl\u00f6p","year":"2004","unstructured":"F\u00fcl\u00f6p, Z., Gazdag, Z., Vogler, H.: Hierarchies of tree series transformations. Theoret. Comput. Sci.\u00a0314, 387\u2013429 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR15","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":"20_CR16","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, Dordrecht (1999)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/inco.2001.2890","volume":"169","author":"S. Bozapalidis","year":"2001","unstructured":"Bozapalidis, S.: Context-free series on trees. Inform. and Comput.\u00a0169, 186\u2013229 (2001)","journal-title":"Inform. and Comput."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01786975","volume":"15","author":"J. Engelfriet","year":"1982","unstructured":"Engelfriet, J.: Three hierarchies of transducers. Math. Systems Theory\u00a015, 95\u2013125 (1982)","journal-title":"Math. Systems Theory"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11505877_30","volume-title":"Developments in Language Theory","author":"A. Maletti","year":"2005","unstructured":"Maletti, A.: The power of tree series transducers of type I and II. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 338\u2013349. Springer, Heidelberg (2005)"},{"key":"20_CR20","doi-asserted-by":"publisher","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. Systems Theory\u00a09, 198\u2013231 (1975)","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:48Z","timestamp":1619507748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11779148_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}