Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterm...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be deco...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decom...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decom...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
AbstractUnfortunately, the class of transformations computed by linear extended top-down tree transd...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
Abstract. Top-down tree transducers are a convenient formalism for describ-ing tree transformations....
AbstractIt is known that by iterating the look-ahead tree languages for deterministic top-down tree ...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
AbstractAs top-down tree transducers generalize generalized sequential machines, shape preserving to...
We prove that functionality of compositions of top-down tree transducers is decidable by reducing th...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterm...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be deco...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decom...
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decom...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
AbstractUnfortunately, the class of transformations computed by linear extended top-down tree transd...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
Abstract. Top-down tree transducers are a convenient formalism for describ-ing tree transformations....
AbstractIt is known that by iterating the look-ahead tree languages for deterministic top-down tree ...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
AbstractAs top-down tree transducers generalize generalized sequential machines, shape preserving to...
We prove that functionality of compositions of top-down tree transducers is decidable by reducing th...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterm...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
DOI
Add to ORKG