{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:50:24Z","timestamp":1725562224309},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_26","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"363-377","source":"Crossref","is-referenced-by-count":18,"title":["Tree Transducers and Tree Compressions"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Maneth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Busatto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. In: Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1998)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Freytag, J.C., et al. (eds.) Proc. VLDB 2003. Morgan Kaufmann, San Francisco (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59126-6_3"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01178504","volume":"29","author":"J. Engelfriet","year":"1992","unstructured":"Engelfriet, J., Heyker, L.: Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica\u00a029, 161\u2013210 (1992)","journal-title":"Acta Informatica"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1999.2807","volume":"154","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput.\u00a0154, 34\u201391 (1999)","journal-title":"Inform. and Comput."},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-46464-8_2","volume-title":"Theory and Application of Graph Transformations","author":"J. Engelfriet","year":"2000","unstructured":"Engelfriet, J., Maneth, S.: Tree languages generated by context-free graph grammars. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 15\u201329. Springer, Heidelberg (2000)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00236-003-0120-0","volume":"39","author":"J. Engelfriet","year":"2003","unstructured":"Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Informatica\u00a039, 613\u2013698 (2003)","journal-title":"Acta Informatica"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. J. of Comp. Syst. Sci.\u00a031, 71\u2013146 (1985)","journal-title":"J. of Comp. Syst. Sci."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/S0022-0000(05)80050-9","volume":"49","author":"J. Engelfriet","year":"1994","unstructured":"Engelfriet, J., Vogler, H.: The translation power of top-down tree-to-graph transducers. J. of Comp. Syst. Sci.\u00a049, 258\u2013305 (1994)","journal-title":"J. of Comp. Syst. Sci."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/LICS.2003.1210058","volume-title":"Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science \u2013 LICS 2003","author":"M. Frick","year":"2003","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science \u2013 LICS 2003, pp. 188\u2013197. IEEE, Los Alamitos (2003)"},{"key":"26_CR11","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Springer, Heidelberg (1997)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(99)00050-X","volume":"227","author":"S. Guerrini","year":"1999","unstructured":"Guerrini, S.: A general theory of sharing graphs. TCS\u00a0227, 99\u2013151 (1999)","journal-title":"TCS"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1142\/S0129054190000291","volume":"1","author":"J. Katajainen","year":"1990","unstructured":"Katajainen, J., M\u00e4kinen, E.: Tree compression and optimization with applications. Intern. J. of Foundations of Comput. Sci.\u00a01, 425\u2013447 (1990)","journal-title":"Intern. J. of Foundations of Comput. Sci."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/96709.96711","volume-title":"Proc. POPL 1990","author":"J. Lamping","year":"1990","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reductions. In: Proc. POPL 1990, pp. 16\u201330. ACM Press, New York (1990)"},{"key":"26_CR15","first-page":"205","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002)","author":"E. Lehman","year":"2002","unstructured":"Lehman, E., Shelat, A.: Approximation algorithms for grammar-based compression. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 205\u2013212. SIAM Press, Philadelphia (2002)"},{"key":"26_CR16","first-page":"153","volume-title":"Proc. ACM Conference on Management of Data","author":"H. Liefke","year":"2000","unstructured":"Liefke, H., Suciu, D.: XMill: An efficient compressor for xml data. In: Chen, W., et al. (eds.) Proc. ACM Conference on Management of Data, pp. 153\u2013164. ACM, New York (2000)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36206-1_24","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"S. Maneth","year":"2002","unstructured":"Maneth, S.: The complexity of compositions of deterministic tree transducers. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 265\u2013276. Springer, Heidelberg (2002)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-44543-9_6","volume-title":"Revised Papers DBPL 1999","author":"S. Maneth","year":"2000","unstructured":"Maneth, S., Neven, F.: Recursive structured document transformations. In: Connor, R., Mendelzon, A. (eds.) DBPL 1999. LNCS, vol.\u00a01949, pp. 80\u201398. Springer, Heidelberg (2000)"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. of Comp. Syst. Sci.\u00a066, 66\u201397 (2003)","journal-title":"J. of Comp. Syst. Sci."},{"key":"26_CR20","unstructured":"Perst, T., Seidl, H.: Macro forest transducers (to appear in IPL)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T17:19:46Z","timestamp":1552843186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}