The Complexity of Translation Membership for Macro Tree Transducers

tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the "translation membership problem" is studied for mtts. For a fixed translation, the translation membership problem asks whether a given input/output pair is element of the translation. For call-by-name mtts this problem is shown to be NP-complete. The main result is that trans- lation membership for call-by-value mtts is in polynomial time. For several extensions, such as addition of regular look-ahead or the generalization to multi-return mtts, it is shown that translation membership still remains in PTIME.

[1]  William C. Rounds,et al.  Complexity of Recognition in Intermediate-Level Languages , 1973, SWAT.

[2]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[3]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[4]  Sebastian Maneth,et al.  The Complexity of Compositions of Deterministic Tree Transducers , 2002, FSTTCS.

[5]  Sebastian Maneth,et al.  XML Type Checking for Macro Tree Transducers with Holes , 2008, PLAN-X.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[8]  Helmut Seidl,et al.  Macro forest transducers , 2004, Inf. Process. Lett..

[9]  Joost Engelfriet,et al.  A comparison of pebble tree transducers with macro tree transducers , 2003, Acta Informatica.

[10]  H. Hosoya,et al.  MTran: An XML Transformation Language Based on Monadic Second Order Logic. , 2007 .

[11]  Sebastian Maneth,et al.  The Complexity of Tree Transducer Output Languages , 2008, FSTTCS.

[12]  Helmut Seidl,et al.  Exact XML Type Checking in Polynomial Time , 2007, ICDT.

[13]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[14]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[15]  Joost Engelfriet,et al.  Macro Tree Translations of Linear Size Increase are MSO Definable , 2003, SIAM J. Comput..

[16]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[17]  Haruo Hosoya,et al.  Multi-Return Macro Tree Transducers , 2008, PLAN-X.

[18]  Helmut Seidl,et al.  XML type checking with macro tree transducers , 2005, PODS.