3 search results - page 1 / 1 » Minimization of Deterministic Bottom-Up Tree Transducers |
164
click to vote
DLT
2010
15 years 6 months ago
2010
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...
160
click to vote
PLANX
2007
15 years 7 months ago
2007
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...
179
Voted
PODS
2010
ACM
15 years 11 months ago
2010
ACM
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 ...