The Complexity of Translation Membership for Macro Tree Transducers

Details The Complexity of Translation Membership for Macro Tree Transducers The Complexity of Translation Membership for Macro Tree Transducers

2009-10-13

arxiv.org/abs/0910.2315v1

Computer Science

Formal Languages and Automata Theory

9 pages, appeared at International Workshop on Programming Language Techniques for XML (PLAN-X 2009)

Scientific paper

Macro 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 translation 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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Translation Membership for Macro Tree Transducers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Translation Membership for Macro Tree Transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Translation Membership for Macro Tree Transducers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640351