{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:33:09Z","timestamp":1710347589717},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2009,10,22]],"date-time":"2009-10-22T00:00:00Z","timestamp":1256169600000},"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":[[2009,12]]},"DOI":"10.1007\/s00236-009-0105-8","type":"journal-article","created":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T16:59:19Z","timestamp":1256144359000},"page":"561-590","source":"Crossref","is-referenced-by-count":18,"title":["Extended multi bottom\u2013up tree transducers"],"prefix":"10.1007","volume":"46","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[]},{"given":"Eric","family":"Lilin","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,22]]},"reference":[{"issue":"1","key":"105_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0022-0000(69)80006-1","volume":"3","author":"A.V. Aho","year":"1969","unstructured":"Aho A.V., Ullman J.D.: Syntax directed translations and the pushdown assembler. J. Comput. Syst. Sci. 3(1), 37\u201356 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR2","doi-asserted-by":"crossref","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst: A General and Efficient Weighted Finite-state Transducer Library. In: CIAA, Lecture Notes in Computer Science, vol. 4783, pp. 11\u201323. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76336-9_3"},{"key":"105_CR3","unstructured":"Arnold, A., Dauchet, M.: Transductions inversibles de for\u00eats. Th\u00e8se 3\u00e8me cycle M. Dauchet, Universit\u00e9 de Lille (1975)"},{"key":"105_CR4","unstructured":"Arnold, A., Dauchet, M.: Bi-transductions de for\u00eats. In: ICALP, pp. 74\u201386. Edinburgh University Press, Edinburgh (1976)"},{"issue":"1","key":"105_CR5","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\u2019arbres. Theor. Comput. Sci. 20(1), 33\u201393 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"105_CR6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"B.S. Baker","year":"1979","unstructured":"Baker B.S.: Composition of top-down and bottom-up tree transductions. Inf. Control 41(2), 186\u2013213 (1979)","journal-title":"Inf. Control"},{"key":"105_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel J.: Transductions and Context-free Languages. Teubner, Stuttgart (1979)"},{"issue":"1","key":"105_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1684","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. J. Comput. Syst. Sci. 61(1), 1\u201350 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","volume":"17","author":"B. Courcelle","year":"1982","unstructured":"Courcelle B., Franchi-Zannettacci P.: Attribute grammars and recursive program schemes. Theor. Comput. Sci. 17, 163\u2013191, 235\u2013257 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"105_CR10","unstructured":"DeNeefe, S., Knight, K., Wang, W., Marcu, D.: What can syntax-based MT learn from phrase-based MT? In: EMNLP & CoNLL, pp. 755\u2013763. The Association for Computational Linguistics, Stroudsburg (2007)"},{"issue":"3","key":"105_CR11","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: a comparison. Math. Syst. Theory 9(3), 198\u2013231 (1975)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"105_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10(1), 289\u2013303 (1977)","journal-title":"Math. Syst. Theory"},{"key":"105_CR13","unstructured":"Engelfriet, J.: Tree transducers and syntax-directed semantics. Technical Report Memorandum 363, Technische Hogeschool Twente, 1981. In: Proceedings of 7th CAAP, pp. 82\u2013107 (1982)"},{"key":"105_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-59126-6_3","volume-title":"Handbook of Formal Languages, vol. 3, chap. 3","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages, vol. 3, chap. 3, pp. 125\u2013213. Springer, Berlin (1997)"},{"key":"105_CR15","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Lilin, E., Maletti, A.: Extended multi bottom-up tree transducers. In: DLT, Lecture Notes in Computer Science, vol. 5257, pp. 289\u2013300. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85780-8_23"},{"issue":"1","key":"105_CR16","doi-asserted-by":"crossref","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. Inf. Comput. 154(1), 34\u201391 (1999)","journal-title":"Inf. Comput."},{"issue":"2","key":"105_CR17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet J., Rozenberg G., Slutzki G.: Tree transducers, L systems, and two-way machines. J. Comput. Syst. Sci. 20(2), 150\u2013202 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR18","first-page":"261","volume":"5","author":"Z. F\u00fcl\u00f6p","year":"1981","unstructured":"F\u00fcl\u00f6p Z.: On attributed tree transducers. Acta Cybern. 5, 261\u2013279 (1981)","journal-title":"Acta Cybern."},{"issue":"2","key":"105_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ipl.2004.03.014","volume":"91","author":"Z. F\u00fcl\u00f6p","year":"2004","unstructured":"F\u00fcl\u00f6p Z., K\u00fchnemann A., Vogler H.: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91(2), 57\u201367 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"105_CR20","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.tcs.2005.07.025","volume":"347","author":"Z. F\u00fcl\u00f6p","year":"2005","unstructured":"F\u00fcl\u00f6p Z., K\u00fchnemann A., Vogler H.: Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347(1\u20132), 276\u2013287 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"105_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6423(83)90021-7","volume":"3","author":"H. Ganzinger","year":"1983","unstructured":"Ganzinger H.: Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Prog. 3(3), 223\u2013278 (1983)","journal-title":"Sci. Comput. Prog."},{"key":"105_CR22","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":"105_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of Formal Languages, vol. 3, chap. 1","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. 3, chap. 1., pp. 1\u201368. Springer, Berlin (1997)"},{"issue":"4","key":"105_CR24","doi-asserted-by":"crossref","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 Inf. 25(4), 355\u2013423 (1988)","journal-title":"Acta Inf."},{"key":"105_CR25","unstructured":"Graehl, J.: Carmel. ISI\/USC. http:\/\/www.isi.edu\/licensed-sw\/carmel (1997)"},{"key":"105_CR26","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: HLT-NAACL, pp. 105\u2013112. The Association for Computational Linguistics, Stroudsburg (2004) (see also [27])"},{"issue":"3","key":"105_CR27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1162\/coli.2008.07-051-R2-03-57","volume":"34","author":"J. Graehl","year":"2008","unstructured":"Graehl J., Knight K., May J.: Training tree transducers. Comput. Linguist. 34(3), 391\u2013427 (2008)","journal-title":"Comput. Linguist."},{"key":"105_CR28","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E., Ullman J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"105_CR29","doi-asserted-by":"crossref","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: CICLing, Lecture Notes in Computer Science, vol. 3406, pp 1\u201324. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30586-6_1"},{"key":"105_CR30","unstructured":"K\u00fchnemann, A.: Berechnungsst\u00e4rken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technische Universit\u00e4t Dresden (1997)"},{"key":"105_CR31","doi-asserted-by":"crossref","unstructured":"K\u00fchnemann, A.: Benefits of tree transducers for optimizing functional programs. In: FSTTCS. Lecture Notes in Computer Science, vol. 1530, pp. 146\u2013157. Springer, Berlin (1998)","DOI":"10.1007\/978-3-540-49382-2_13"},{"key":"105_CR32","unstructured":"Lilin, E.: Une g\u00e9n\u00e9ralisation des transducteurs d\u2019\u00e9tats finis d\u2019arbres: les S-transducteurs. Th\u00e8se 3\u00e8me cycle, Universit\u00e9 de Lille (1978)"},{"key":"105_CR33","doi-asserted-by":"crossref","unstructured":"Lilin, E.: Propri\u00e9t\u00e9s de cl\u00f4ture d\u2019une extension de transducteurs d\u2019arbres d\u00e9terministes. In: CAAP, Lecture Notes in Computer Science, vol. 112, pp. 280\u2013289. Springer, Berlin (1981)","DOI":"10.1007\/3-540-10828-9_69"},{"issue":"9\u201310","key":"105_CR34","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(9\u201310), 1187\u20131196 (2008)","journal-title":"Inf. Comput."},{"issue":"2","key":"105_CR35","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/070699160","volume":"39","author":"A. Maletti","year":"2009","unstructured":"Maletti A., Graehl J., Hopkins M., Knight K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410\u2013430 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"105_CR36","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0304-3975(97)00190-4","volume":"223","author":"O. Rambow","year":"1999","unstructured":"Rambow O., Satta G.: Independent parallelism in finite copying parallel rewriting systems. Theor. Comput. Sci. 223(1\u20132), 87\u2013120 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"105_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.36045\/bbms\/1105730627","volume":"4","author":"J.C. Raoult","year":"1997","unstructured":"Raoult J.C.: Rational tree relations. Bull. Belg. Math. Soc. 4, 149\u2013176 (1997)","journal-title":"Bull. Belg. Math. Soc."},{"issue":"3","key":"105_CR38","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds W.C.: Mappings and grammars on trees. Math. Syst. Theory 4(3), 257\u2013287 (1970)","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"105_CR39","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"Seki H., Matsumura T., Fujii M., Kasami T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"105_CR40","unstructured":"Shabes, Y.: Mathematical and computational aspects of lexicalized grammars. Ph.D. thesis, University of Pennsylvania (1990)"},{"key":"105_CR41","unstructured":"Shieber, S.M.: Unifying synchronous tree adjoining grammars and tree transducers via bimorphisms. In: EACL, pp. 377\u2013384. The Association for Computational Linguistics, Stroudsburg (2006)"},{"key":"105_CR42","doi-asserted-by":"crossref","unstructured":"Shieber, S.M., Shabes, Y.: Synchronous tree-adjoining grammars. In: COLING, pp. 1\u20136. The Association for Computational Linguistics, Stroudsburg (1990)","DOI":"10.3115\/991146.991191"},{"key":"105_CR43","doi-asserted-by":"crossref","unstructured":"Steinby, M., T\u00eern\u0103uc\u0103, C.I.: Syntax-directed translations and quasi-alphabetic tree bimorphisms. In: CIAA, Lecture Notes in Computer Science, vol. 4783, pp. 265\u2013276. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76336-9_25"},{"issue":"4","key":"105_CR44","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"J.W. Thatcher","year":"1970","unstructured":"Thatcher J.W.: Generalized2 sequential machine maps. J. Comput. Syst. Sci. 4(4), 339\u2013367 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR45","first-page":"143","volume-title":"Currents in the Theory of Computing","author":"J.W. Thatcher","year":"1973","unstructured":"Thatcher J.W.: Tree automata: An informal survey. In: Aho, A.V. (eds) Currents in the Theory of Computing, pp. 143\u2013172. Prentice-Hall, Englewood Cliffs (1973)"},{"key":"105_CR46","doi-asserted-by":"crossref","unstructured":"Weir, D.J.: Linear context-free rewriting systems and deterministic tree-walking transducers. In: ACL, pp. 136\u2013143. The Association for Computational Linguistics, Stroudsburg (1992)","DOI":"10.3115\/981967.981985"},{"key":"105_CR47","doi-asserted-by":"crossref","unstructured":"Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: ACL, pp. 303\u2013310. The Association for Computational Linguistics, Stroudsburg (2002)","DOI":"10.3115\/1073083.1073134"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0105-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0105-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0105-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T05:24:46Z","timestamp":1590211486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0105-8"}},"subtitle":["Composition and decomposition"],"short-title":[],"issued":{"date-parts":[[2009,10,22]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0105-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,22]]}}}