Extended Multi Bottom-Up Tree Transducers

Extended multi bottom-up tree transducers are defined and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute any transformation that is computed by a linear extended top-down tree transducer. Moreover, the classical composition results for bottom-up tree transducers are generalized to extended multi bottom-up tree transducers. Finally, a characterization in terms of extended top-down tree transducers is presented.

[1]  Joost Engelfriet,et al.  Context-Free Graph Grammars , 1997, Handbook of Formal Languages.

[2]  Harald Ganzinger.  Increasing Modularity and Language-Independency in Automatically Generated Compilers , 1983, Sci. Comput. Program..

[3]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[4]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[5]  Armin Kühnemann.  Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata , 1997 .

[6]  Armin Kühnemann,et al.  Benefits of Tree Transducers for Optimizing Functional Programs , 1998, FSTTCS.

[7]  David J. Weir.  Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers , 1992, ACL.

[8]  Giorgio Satta,et al.  Independent Parallelism in Finite Copying Parallel Rewriting Systems , 1999, Theor. Comput. Sci..

[9]  Aravind K. Joshi,et al.  Mathematical and computational aspects of lexicalized grammars , 1990 .

[10]  Andreas Maletti,et al.  Compositions of extended top-down tree transducers , 2008, Inf. Comput..

[11]  Robert Giegerich,et al.  Composition and evaluation of attribute coupled grammars , 1988, Acta Informatica.

[12]  Ferenc Gécseg,et al.  Tree Automata , 2015, ArXiv.

[13]  Joost Engelfriet,et al.  Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations , 1999, Inf. Comput..

[14]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[15]  Stuart M. Shieber,et al.  Synchronous Tree-Adjoining Grammars , 1990, COLING.

[16]  Alfred V. Aho,et al.  Currents In The Theory Of Computing , 1973 .

[17]  Zoltán Fülöp,et al.  A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead , 2004, Inf. Process. Lett..

[18]  Max Dauchet,et al.  Morphismes et Bimorphismes d'Arbres , 1982, Theor. Comput. Sci..

[19]  Max Dauchet,et al.  Bi-transductions de forêts , 1976, International Colloquium on Automata, Languages and Programming.

[20]  Joost Engelfriet,et al.  Bottom-up and top-down tree transformations— a comparison , 1975, Mathematical systems theory.

[21]  Daniel Marcu,et al.  What Can Syntax-Based MT Learn from Phrase-Based MT? , 2007, EMNLP.

[22]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[23]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[24]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[25]  Joost Engelfriet,et al.  A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars , 2000, J. Comput. Syst. Sci..

[26]  Jean-Claude Raoult.  Rational tree relations , 1997 .

[27]  Zoltán Fülöp.  On attributed tree transducers , 1981, Acta Cybern..

[28]  Eric Lilin,et al.  Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes , 1981, CAAP.

[29]  Mark Hopkins,et al.  The Power of Extended Top-Down Tree Transducers , 2009, SIAM J. Comput..

[30]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[31]  Magnus Steinby,et al.  Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms , 2007, CIAA.

[32]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.

[33]  Kevin Knight,et al.  Training Tree Transducers , 2004, NAACL.

[34]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[35]  Alfred V. Aho,et al.  Syntax Directed Translations and the Pushdown Assembler , 1969, J. Comput. Syst. Sci..

[36]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[37]  Stuart M. Shieber.  Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms , 2006, EACL.

[38]  Johan Schalkwyk,et al.  OpenFst: A General and Efficient Weighted Finite-State Transducer Library , 2007, CIAA.

[39]  Zoltán Fülöp,et al.  Linear deterministic multi bottom-up tree transducers , 2005, Theor. Comput. Sci..

[40]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[41]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[42]  Brenda S. Baker,et al.  Composition of Top-Down and Bottom-Up Tree Transductions , 1979, Inf. Control..