The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers

Journal of Computer and System Sciences

Volumn 56, Issue 3, 1998, Pages 332-356

  Engelfriet, Joost ^a   Vogler, Heiko ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

BOTTOM-UP TREE TRANSDUCERS; TREE-TO-GRAPH TRANSDUCERS;

COMPUTATIONAL GRAMMARS;

EID: 0032090527     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1573     Document Type: Article

References (39)

1. A. V. Aho and J. D. Ullman, Translations on a context free grammar, Inform. & Control 19 (1971), 439-475.
2. A. V. Aho and J. D. Ullman, "The Theory of Parsing, Translation and Compiling, Vol. I, Vol. II," Prentice-Hall, Englewood Cliffs, NJ, 1973.
3. B. S. Baker, Composition of top-down and bottom-up tree transductions, Inform. & Control 41 (1979), 186-213.
4. M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83-127.
5. B. Courcelle and P. Franchi-Zannettacci, Attribute grammars and recursive program schemes I and II, Theoret. Comput. Sci. 17 (1982), 163-191, 235-257.
6. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141-181.
7. W. Damm and I. Guessarian, Combining T and level-N, in "Proceedings of the MFCS'96, LNCS 118" (J. Gruska and M. Chytil, Eds.), pp. 262-270, Springer-Verlag, New York/ Berlin, 1981.
8. F. Drewes, A. Habel, and H.-J. Kreowski, Hyperedge replacement graph grammars, in "Graph Grammars and Computing by Graph Transformation, Vol. I. Foundations" (G. Rozenberg, Ed.), Chap. 2, World Scientific, Singapore, 1997.
9. F. Drewes, Semirings and tree-to-graph-to-tree transductions, in "Proc. of SEGRAGRA'95, Electronic Notes in Theoretical Computer Science 2" Elsevier Science, Amsterdam, 1995.
10. F. Drewes, "Computation by Tree Transductions," Ph.D. thesis, University of Bremen, 1996.
11. F. Drewes, The use of tree transducers to compute translations between graph algebras, in "Graph grammars and Their Application to Computer Science, LNCS 1073" (J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, Eds.), pp. 196-210, Springer-Verlag, New York/Berlin, 1996.
12. J. Engelfriet and G. File, The formal power of one-visit attribute grammars, Acta Inform. 16 (1981), 275-302.
13. J. Engelfriet and L. Heyker, Context-free hypergraph grammars have the same term-generating power as attribute grammars, Acta Inform. 29 (1992), 161-210.
14. J. Engelfriet, Bottom-up and top-down tree transformations - A comparison, Math. Systems Theory 9 (1975), 198-231.
15. J. Engelfriet, Top-down tree transducers with regular look-ahead, Math. Systems Theory 10 (1977), 289-303.
16. J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, in "Formal Language Theory: Perspectives and Open Problems" (R. V. Book, Ed.), pp. 241-286, Academic Press, New York, 1980.
17. J. Engelfriet, G. Rozenberg, and G. Slutzki, Tree transducers, L systems, and two-way machines, J. Comput. Sci. 20 (1980), 150-202.
18. J. Engelfriet and H. Vogler, Macro tree transducers, J. Comput. System Sci. 31 (1985), 71-146.
19. J. Engelfriet and H. Vogler, Pushdown machines for the macro tree transducer, Theoret. Comput. Sci. 42 (1986), 251-368.
20. J. Engelfriet and H. Vogler, High level tree transducers and iterated pushdown tree transducers, Acta Inform. 26 (1988), 131-192.
21. J. Engelfriet and H. Vogler, Modular tree transducers, Theoret. Comput. Sci. 78 (1991), 267-304.
22. J. Engelfriet and H. Vogler, The translation power of top-down tree-to-graph transducers, J. Comput. System Sci. 49 (1994), 258-305.
23. Z. Fülöp, On attributed tree transducers, Acta Cybernet. 5 (1981), 261-279.
24. R. Giegerich, Composition and evaluation of attribute coupled grammars, Acta Inform. 25 (1988), 355-423.
25. F. Gécseg and M. Steinby, "Tree Automata," Akadémiai Kiadó, Budapest, 1984.
26. I. Guessarian, Pushdown tree automata, Math. System Theory 16 (1983), 237-263.
27. A. Habel "Hyperedge-Replacement: Grammars and Languages, LNCS, Vol. 643," Springer-Verlag, New York/Berlin, 1992.
28. A. Habel and H.-J. Kreowski, May we introduce to you: Hyperedge replacement, in "Graph Grammars and Their Application to Computer Science, LNCS 291" (H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, Eds.), pp. 15-26, Springer-Verlag, New York/Berlin, 1987.
29. A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, in "STACS 97, LNCS 247" (F. J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, Eds.), pp. 207-219, Springer-Verlag, New York/Berlin, 1987.
30. A. Habel, H.-J. Kreowski, and D. Plump, Jungle evaluation, Fund. Inform. 15 (1991), 37-60.
31. D. E. Knuth, Semantics of context-free languages, Math. Systems Theory 2 (1968), 127-145.
32. C. H. A. Koster, Affix grammars, in "Proc. of the IFIP Working Conf. on ALGOL68 Implementation" (J. E. L. Peck, Ed.), pp. 95-109, North-Holland, Amsterdam, 1971.
33. M. F. Kuiper, S. D. Swierstra, and H. H. Vogt, Higher order attribute grammars, in "Proc. SIGPLAN'89, Symp. Language Design and Implementation," pp. 131-145, ACM Press, New York, 1989.
34. A. Kühnemann and H. Vogler, Synthesized and inherited functions - A new computational model for syntax-directed semantics, Acta Inform. 31 (1994), 431-477.
35. W. C. Rounds, Mappings and grammars on trees, Math. Systems Theory 4 (1970), 257-287.
36. K. M. Schimpf and J. H. Gallier, Tree pushdown automata, J. Comput. System Sci. 30 (1985), 25-40.
37. 2 sequential machine maps, J. Comput. System Sci. 4 (1970), 339-367.
38. J. W. Thatcher, Tree automata: An informal survey, in "Currents in the Theory of Computing" (A. V. Aho, Ed.), pp. 143-172, Prentice-Hall, Englewood Cliffs, NJ, 1973.
39. J. W. Thatcher and J. B. Wright, Generalized finite automata theory with application to a decision problem of second-order logic, Math. Systems Theory 2 (1968), 57-81.