The use of tree transducers to compute translations between graph algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1073, Issue , 1996, Pages 196-210

  Drewes, Frank ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY; FORMAL LANGUAGES; TRANSDUCERS;

2-TREES; BOTTOM UP; EDGE REPLACEMENT; GRAPH ALGEBRA; HYPEREDGE REPLACEMENT; SERIES-PARALLEL GRAPH; TOPDOWN; TREE TRANSDUCERS;

TREES (MATHEMATICS);

EID: 21344473352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_88     Document Type: Conference Paper

References (12)

1. Brenda S. Baker. Composition of top-down and bottom-up tree transductions. Information and Control 41, 186-213, 1979.
2. Michel Bauderon, Bruno Courcelle. Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83-127, 1987.
3. Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theoretical Computer Science 80, 153-202, 1991.
4. Frank Drewes. The use of tree transducers to compute translations between graph algebras. Report 8/94, Univ. Bremen, 1994.
5. Joost Engelfriet. Bottom-up and top-down tree transformations--a comparison. Mathematical Systems Theory 9(3), 198-231, 1975.
6. Joost Engelfriet. On tree transducers for partial functions. Information Processing Letters 7, 170-172, 1978.
7. Joost Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, 241-286. Academic Press, New York, 1980.
8. Joost Engelfriet. Graph grammars and tree transducers. In Proc. CAAP 94, Lecture Notes in Computer Science 787, 15-37, 1994.
9. Joost Engelfriet, Heiko Vogler. The translation power of top-down tree-to-graph transducers. Journal of Computer and System Sciences 49,258-305, 1994.
10. J. E. Hopcroft, R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135-158, 1973.
11. S. MacLane. A structural characterization of planax combinatorial graphs. Duke Mathematical Journal 3, 460-472, 1937.
12. Walter Vogler. Recognizing edge replacement graph languages in cubic time. In H. Ehrig, Hans-Jörg Kreowski, G. Rozenberg, editors, Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., Lecture Notes in Computer Science 532, 676-687, 1991.