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