Sciweavers

3 search results - page 1 / 1
» Minimization of Deterministic Bottom-Up Tree Transducers
Sort
View
DLT
2010
13 years 11 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
PLANX
2007
14 years 8 days 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 equiva...
Sebastian Maneth, Helmut Seidl
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 4 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...