Sciweavers

Share
PLANX
2007

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time

9 years 3 months ago
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
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
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where PLANX
Authors Sebastian Maneth, Helmut Seidl
Comments (0)
books