Deciding equivalence of top--down XML transformations in polynomial time

Authors:
Joost Engelfriet;Sebastian Maneth;Helmut Seidl
Affiliations:
Leiden Institute of Advanced Computer Science, The Netherlands;NICTA and University of NSW, Sydney, Australia;Institut für Informatik, Technische Universität München, Germany
Venue:
Journal of Computer and System Sciences
Year:
2009

Citing 15
Cited 7

Top-down tree transducers with deterministic top-down look-ahead

Information Processing Letters
Top-down tree transducers with two-way tree walking look-ahead

Theoretical Computer Science
Minimal Ascending and Descending Tree Automata

SIAM Journal on Computing
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Minimization algorithms for sequential transducers

Theoretical Computer Science
An efficient automata approach to some problems on context-free grammars

Information Processing Letters
Towards static type checking for XSLT

DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
Tree pattern query minimization

The VLDB Journal — The International Journal on Very Large Data Bases
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Macro forest transducers

Information Processing Letters
On the complexity of typechecking top-down XML transformations

Theoretical Computer Science - Database theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
The equivalence problem for deterministic MSO tree transducers is decidable

Information Processing Letters
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Generalized2 sequential machine maps

Journal of Computer and System Sciences

Equivalence of deterministic nested word to word transducers

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A learning algorithm for top-down XML transformations

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewrite-based verification of XML updates

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Minimization of deterministic bottom-up tree transducers

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Normalization of sequential top-down tree-to-word transducers

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Symbolic tree transducers

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Learning rational functions

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many useful XML transformations can be expressed by deterministic top-down tree transducers. A normal form is presented for such transducers (extended with the facility to inspect their input trees). A transducer in normal form has a unique canonical form which can be obtained by a minimization procedure, in polynomial time. Thus, equivalence of transducers in normal form can be decided in polynomial time. If the transducer is total, the normal form can be obtained in polynomial time as well.