11 search results - page 1 / 3 » The Equivalence Problem for Deterministic MSO Tree Transduce... |
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
PLANX
2007
13 years 6 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...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...