AbstractIt is shown that top-down tree transducers are as powerful as sharing-free tree-to-graph-to-tree transducers as far as the computation of functions is considered whose codomain is a semiring.I am grateful to Renate Klempien-Hinrichs and to the referees, who gave helpful hints on the presentation of the work reported here
Tree series transformations computed by bottom-up and top-down tree series transducers are called bo...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
It is shown that top-down tree transducers are as powerful as sharing-free tree-tograph -to-tree tra...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Tree transducers may be used to perform symbolic computations. A function f from one algebra into an...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deter...
In this paper we implement bottom-up tree series transducers (tst) over the semiring A with the help...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are...
The power of top-down tree transducers and tree-to-graph-to-tree transducers (tgt transducers) to co...
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-t...
Tree series transformations computed by bottom-up and top-down tree series transducers are called bo...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
It is shown that top-down tree transducers are as powerful as sharing-free tree-tograph -to-tree tra...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Tree transducers may be used to perform symbolic computations. A function f from one algebra into an...
Abstract. We introduce top-down deterministic transducers with ra-tional lookahead (transducer for s...
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deter...
In this paper we implement bottom-up tree series transducers (tst) over the semiring A with the help...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are...
The power of top-down tree transducers and tree-to-graph-to-tree transducers (tgt transducers) to co...
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-t...
Tree series transformations computed by bottom-up and top-down tree series transducers are called bo...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
DOI
Add to ORKG