AbstractIn this paper we give a deterministic bottom-up tree transducer T and show that the tree transformation τ(T) induced by it can be induced by no attributed tree transducer
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
AbstractThe relationship between classes of tree-to-tree-series and o-tree-to-tree-series transforma...
AbstractIn this paper we give a deterministic bottom-up tree transducer T and show that the tree tra...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
Abstract. We show that for every deterministic bottom-up tree transducer, a unique equivalent transd...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
AbstractIt is known that by iterating the look-ahead tree languages for deterministic top-down tree ...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-t...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
AbstractWe show that it is decidable for any deterministic bottom-up tree transducer A and ground te...
AbstractThe relationship between classes of tree-to-tree-series and o-tree-to-tree-series transforma...
Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterm...
AbstractUnfortunately, the class of transformations computed by linear extended top-down tree transd...
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
AbstractThe relationship between classes of tree-to-tree-series and o-tree-to-tree-series transforma...
AbstractIn this paper we give a deterministic bottom-up tree transducer T and show that the tree tra...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
Abstract. We show that for every deterministic bottom-up tree transducer, a unique equivalent transd...
AbstractWe consider top-down tree transducers with deterministic, nondeterministic and universal two...
AbstractIt is known that by iterating the look-ahead tree languages for deterministic top-down tree ...
AbstractIn general, top-down and bottom-up tree transducers lead to incomparable classes of tree tra...
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-t...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
AbstractWe show that it is decidable for any deterministic bottom-up tree transducer A and ground te...
AbstractThe relationship between classes of tree-to-tree-series and o-tree-to-tree-series transforma...
Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterm...
AbstractUnfortunately, the class of transformations computed by linear extended top-down tree transd...
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
AbstractThe relationship between classes of tree-to-tree-series and o-tree-to-tree-series transforma...
DOI
Add to ORKG