{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:25Z","timestamp":1759638625586},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_28","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"326-337","source":"Crossref","is-referenced-by-count":9,"title":["The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Maneth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","first-page":"1","volume":"61","author":"R. Bloem","year":"2000","unstructured":"Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. JCSS\u00a061, 1\u201350 (2000)","journal-title":"JCSS"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0306-4379(01)00033-3","volume":"27","author":"G.J. Bex","year":"2002","unstructured":"Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information Systems\u00a027, 21\u201339 (2002)","journal-title":"Information Systems"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2498\/cit.2002.01.02","volume":"10","author":"A. Berlea","year":"2002","unstructured":"Berlea, A., Seidl, H.: Transforming XML documents using fxt. J. of Computing and Information Technology\u00a010, 19\u201335 (2002)","journal-title":"J. of Computing and Information Technology"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci.\u00a0126, 53\u201375 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2715","volume":"145","author":"F. Drewes","year":"1998","unstructured":"Drewes, F., Engelfriet, J.: Decidability of finiteness of ranges of tree transductions. Inform. and Comput.\u00a0145, 1\u201350 (1998)","journal-title":"Inform. and Comput."},{"key":"28_CR6","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":"28_CR7","first-page":"350","volume":"64","author":"J. Engelfriet","year":"2002","unstructured":"Engelfriet, J., Maneth, S.: Output string languages of compositions of deterministic macro tree transducers. JCSS\u00a064, 350\u2013395 (2002)","journal-title":"JCSS"},{"key":"28_CR8","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":"28_CR9","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1137\/S0097539701394511","volume":"32","author":"J. Engelfriet","year":"2003","unstructured":"Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput.\u00a032, 950\u20131006 (2003)","journal-title":"SIAM J. Comput."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0020-0190(78)90060-1","volume":"7","author":"J. Engelfriet","year":"1978","unstructured":"Engelfriet, J.: On tree transducers for partial functions. Informat. Processing Let.\u00a07, 170\u2013172 (1978)","journal-title":"Informat. Processing Let."},{"key":"28_CR11","first-page":"71","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS\u00a031, 71\u2013146 (1985)","journal-title":"JCSS"},{"key":"28_CR12","first-page":"261","volume":"5","author":"Z. F\u00fcl\u00f6p","year":"1981","unstructured":"F\u00fcl\u00f6p, Z.: On attributed tree transducers. Acta Cybernetica\u00a05, 261\u2013279 (1981)","journal-title":"Acta Cybernetica"},{"key":"28_CR13","volume-title":"EATCS Monographs in Theoretical Computer Science","author":"Z. F\u00fcl\u00f6p","year":"1998","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Syntax-Directed Semantics \u2013 Formal Models based on Tree Transducers. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (1998)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Giegerich, R.: Attribute coupled grammars. In: Proc. ACM Symp. on Compiler Construction, SIGPLAN Not., vol.\u00a019, pp. 157\u2013170 (1984)","DOI":"10.1145\/502949.502890"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02737108","volume":"25","author":"R. Giegerich","year":"1988","unstructured":"Giegerich, R.: Composition and evaluation of attribute coupled grammars. Acta Informatica\u00a025, 355\u2013423 (1988)","journal-title":"Acta Informatica"},{"key":"28_CR16","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":"28_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory\u00a02, 127\u2013145 (1968), Corrections in Math. Systems Theory 5, 95\u201396 (1971)","journal-title":"Math. Systems Theory"},{"key":"28_CR18","unstructured":"K\u00fchnemann, A.: Berechnungsst\u00e4rken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technical University Dresden (1997)"},{"key":"28_CR19","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":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-44543-9_6","volume-title":"Research Issues in Structured and Semistructured Database Programming","author":"S. Maneth","year":"2000","unstructured":"Maneth, S., Neven, F.: Recursive structured document transformations. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol.\u00a01949, pp. 80\u201398. Springer, Heidelberg (2000)"},{"key":"28_CR21","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":"28_CR22","unstructured":"Perst, T., Seidl, H.: Macro forest transducers. To appear in IPL"},{"key":"28_CR23","first-page":"18","volume-title":"Proceeding of the ACM Symposium on Document Engineering","author":"A. Tozawa","year":"2001","unstructured":"Tozawa, A.: Towards static type checking for XSLT. In: Proceeding of the ACM Symposium on Document Engineering, pp. 18\u201327. ACM Press, New York (2001)"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/375551.375554","volume-title":"Proc. PODS 2001","author":"V. Vianu","year":"2001","unstructured":"Vianu, V.: A Web Odyssey: From Codd to XML. In: Proc. PODS 2001, pp. 1\u201315. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:46:16Z","timestamp":1558298776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}