Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

PLANX
2007

favoriteEmaildiscussreport

109views Programming Languages» more PLANX 2007»

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time

13 years 5 months ago

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time

Download www2.in.tum.de

Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equivalence of their induced transformations in polynomial time. If the transducer is total, the canonical form can be obtained in polynomial time as well. Keywords Xml, top-down tree transducer, equivalence, minimization.

Sebastian Maneth, Helmut Seidl

Real-time Traffic

Canonical Form | PLANX 2007 | Polynomial Time | Programming Languages | Top-down Tree Transducer |

claim paper

Related Content

» Exact XML Type Checking in Polynomial Time

» Testing the executability of scenarios in general inhibitor nets

» Efficient Inclusion for a Class of XML Types with Interleaving and Counting

» Rewritebased verification of XML updates

» Adaptive Scheduling of Data Paths using Uppaal Tiga

» PartiallyCommutative ContextFree Processes

» Characterizing EF and EX Tree Logics

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	PLANX
Authors	Sebastian Maneth, Helmut Seidl

Comments (0)