Add to ORKGThe power of top-down tree transducers and tree-to-graph-to-tree transducers (tgt transducers) to compute translations between hyperedge-replacement algebras is investigated. It turns out that top-down tree transducers are weak in many cases, too. Tgt transducers are shown to be more powerful. (orig.)SIGLEAvailable from TIB Hannover: RO 802(1994,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...
. The power of top-down tree transducers and tree-to-graphto -tree transducers (tgt transducers) to ...
. The power of top-down, bottom-up, and tree-to-graphto -tree transducers (tgt transducers) to compu...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deter...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
. A characterization of the sets of hypertrees generated by hyperedgereplacement graph grammars is e...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
Tree transducers may be used to perform symbolic computations. A function f from one algebra into an...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...
. The power of top-down tree transducers and tree-to-graphto -tree transducers (tgt transducers) to ...
. The power of top-down, bottom-up, and tree-to-graphto -tree transducers (tgt transducers) to compu...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deter...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
AbstractWe introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (tot...
. A characterization of the sets of hypertrees generated by hyperedgereplacement graph grammars is e...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
We develop a finite-state transducer for translating unranked trees into general graphs. This work i...
Tree transducers may be used to perform symbolic computations. A function f from one algebra into an...
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up t...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...
AbstractWe define a new type of tree transducers. The family of transformations computed by them is ...