F. Drewes. The use of tree transducers to compute translations between graph algebras. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear. (Long version in Report 8/94, Univ. Bremen, 1994.) 39 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computing by Graph Transformation II (COMPUGRAPH II) - Ehrig, (eds.) (1996) (Correct)
....a linear factor if the target al..gebra contains only monotonic operations. An investigation of the power of top down, bottom up, and tree to graph to tree transducers (tgt transducers) to compute translations from hyperedge replacement algebras into edge replacement algebras is carried out in [Dre95a] Compositions of top down and bottomup tree transducers turn out to be too weak if the operations in the target al..gebra can define series parallel graphs, 2 trees, or related types of graphs. Tgt transducers are shown to be more powerful. They can compute translations into ER algebras whose ....
F. Drewes. The use of tree transducers to compute translations between graph algebras. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear. (Long version in Report 8/94, Univ. Bremen, 1994.) 39
Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (3 citations) (Correct)
....by more than a linear factor if the target al..gebra contains only monotonic operations. An investigation of the power of top down, bottom up, and tree to graph to tree transducers (tgt transducers) to compute translations from HR algebras into ER (edge replacement) algebras is carried out in [Dre95a] Compositions of top down and bottom up tree transducers turn out to be too weak if the operations in the target al..gebra can define 2 trees or related types of graphs. Tgt transducers are shown to be more powerful. They can compute translations into ER algebras whose operations are so called ....
F. Drewes. The use of tree transducers to compute translations between graph algebras. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear. (Long version in Report 8/94, Univ. Bremen, 1994.)
Computing by Graph Transformation II (COMPUGRAPH II) - H. Ehrig, G. Taentzer (Eds.) (1995) (Correct)
....grammars. In [DHT95] Dassow, Habel, and Taubenberger show that regular chain code picture languages can be generated by collage grammars. As a consequence, all known undecidability results for regular chain code languages can be adapted to picture languages generated by collage grammars. Drewes [Dre95a] investigates the power of top down, bottom up, and tree to graph to tree transducers (tgt transducers) to compute translations from hyperedge replacement algebras into edge replacement algebras. Compositions of top down and bottom up tree transducers turn out to be too weak if the operations in ....
Frank Drewes. The use of tree transducers to compute translations between graph algebras. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear. (Long version in Report 8/94, Univ. Bremen, 1994.)
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph.. - Engelfriet, Vogler (1998) (2 citations) (Correct)
....formalism. In this paper we introduce the concept of bottom up tree to graph transducer (for short: bu tg transducer) and we compare its translation power with the translation power of the topdown tree to graph transducer (for short: td tg transducer) which was introduced in [EV94] and studied in [Dre95, Dre96a, Dre96b]. More precisely, we prove that the class tgtB of treeto tree translations which are computed by tree generating bu tg transducers, and the class tgtT of tree to tree translations which are computed by tree generating td tg transducers, are equal. In fact, bu tg transducers and td tg transducers ....
F. Drewes. The use of tree transducers to compute translations between graph algebras. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Graph Grammars and their Application to Computer Science, LNCS 1073, pages 196--210. SpringerVerlag, 1996.
The Use of Tree Transducers to Compute Translations Between.. - Frank Drewes (1996) (4 citations) Self-citation (Drewes) (Correct)
....into ER algebras whose operations are so called 2tree operations. The class of graphs that can be defined by these operations properly contains the class of all 2 trees and is one of those that are not successfully handled by top down and bottom up tree transducers. This is a short version of [4]; in particular, all proofs are omitted. 2 Hypergraphs, hypergraph operations, and tree transducers We recall briefly the notational conventions and definitions used. The natural extensions of a mapping f to sets and sequences are denoted by f , too. If s is a sequence the set of all its members ....
....transducer that transforms (terms defining) 2tree representations into (terms defining) equivalent term hypergraphs a tgt transducer is obtained which computes the translation whose existence is asserted in Theorem 4.2. The constructions are all effective (which is now easier to see than in [4], thanks to the improved Lemma 4.7) Unfortunately, it is not obvious how to extend the result to other sorts of graphs like series parallel graphs or even partial 2 trees. Rather simple generalizations which are not hard to obtain are those which allow, in addition to the constant i, a number of ....
Frank Drewes. The use of tree transducers to compute translations between graph algebras. Report 8/94, Univ. Bremen, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC