The Generating Power of Total Deterministic Tree Transducers

Information and Computation

Volumn 147, Issue 2, 1998, Pages 111-144

  Maneth, Sebastian ^a,b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009288836     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2736     Document Type: Article

References (28)

1. Courcelle B. and Franchi-Zannettacci, P. (1982), Attribute grammars and recursive program schemes, Theoret. Comput. Sci. 17, 163-191; 235-257.
2. Dányi, G. (1996), On domain and range tree languages of superlinear deterministic top-down tree transformations, Acta Cybernetica 12, 261-277.
3. Deransart, P., Jourdan, M., and Lorho, P. (1988), "Attribute Grammars, Definitions and Bibliography," LNCS, No. 323, Springer-Verlag, Berlin/New York.
4. Drewes, F., Kreowski, H.-J., and Habel, A. (1997), Hyperedge replacement graph grammars, in "Handbook of Graph Grammars and Computing by Graph Transformation" (G. Rozenberg, Ed.), Vol. 1, Chap. 2, pp. 95-162, World Scientific, Singapore.
5. Engelfriet, J. and Filè, G. (1981), Passes and paths of attribute grammars, Inform. and Control 49, 125-169.
6. Engelfriet, J. and Heyker, L. (1991), The string-generating power of context-free hypergraph grammars, J. Comput. System Sci. 43, 328-360.
7. Engelfriet, J. and Heyker, L. (1992), Context-free hypergraph grammars have the same term-generating power as attribute grammars, Acta Informatica 29, 161-210.
8. Engelfriet, J. (1975), "Tree Automata and Tree Grammars," lecture notes, DAIMI FN-10, University of Aarhus.
9. Engelfriet, J. (1976), Surface tree languages and parallel derivation trees, Theoret. Comput. Sci. 2, 9-27.
10. Engelfriet, J. (1982), Three hierarchies of transducers, Math. Systems Theory 15, 95-125.
11. Engelfriet, J. (1997), Context-free graph grammars, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 3, Chap. 3, Springer-Verlag, Berlin/New York.
12. Engelfriet, J., Rozenberg, G., and Slutzki, G. (1980), Tree tranducers, L systems, and two-way machines, J. Comput. System Sci. 20, 150-202.
13. Fülöp, Z., Herrmann, F., Vágvölgyi, S., and Vogler, H. (1993), Tree transducers with external functions, Theoret. Comput. Sci. 108, 185-236.
14. Fülöp, Z. (1981), On attributed tree transducers, Acta Cybernetica 5, 261-279.
15. Ganzinger, H. (1983), Increasing modularity and language-independency in automatically generated compilers, Sci. Comput. Program. 3, 223-278.
16. Giegerich, R. (1988), Composition and evaluation of attribute coupled grammars, Acta Informatica 25, 355-423.
17. Gécseg, F. and Steinby, M. (1989), "Tree Automata," Akadémiai Kiadó, Budapest.
18. Habel, A. (1992), "Hyperedge-Replacement: Grammars and Languages," LNCS, Vol. 643, Springer-Verlag, Berlin/New York.
19. Habel, A. and Kreowski, H.-J. (1987), Some structural aspects of hypergraph languages generated by hyperedge replacement, in "Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science, STAGS 87" (F. Brandenburg, Ed.), LNCS, Vol. 247, pp. 207-219, Springer-Verlag, Berlin/New York.
20. Kühnemann, A. and Maneth, S. (in preparation), Relations and applications of pumping lemmata for attributed tree transducers and hyperedge-replacement grammars.
21. Knuth, D. E. (1968), Semantics of context-free languages, Math. Systems Theory 2, 127-145. [Corrections in (1971), Math. Systems Theory 5, 95-96]
22. Knuth, D. E. (1968), Semantics of context-free languages, Math. Systems Theory 2, 127-145. [Corrections in (1971), Math. Systems Theory 5, 95-96]
23. Kühnemann, A. (1997), "Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata," Ph.D. thesis, Technical University Dresden.
24. Kühnemann, A. (1997), A two-dimensional hierarchy for attributed tree transducers, in "Fundamentals of Computation Theory, FCT'97, 11th International Symposium, Kraków, Poland, Proceedings" (B. S. Chlebus and L. Czaja, Ed.), LNCS, Vol. 1279, pp. 281-292, Springer-Verlag, Berlin/New York.
25. Kühnemann, A. and Vogler, H. (1994), A pumping lemma for output languages of attributed tree transducers, Acta Cybernetica 11, 261-305.
26. Maneth, S. (1996), "On the Generating Power of Deterministic Tree Transducers," Technical Report TUD/FI96/19, Technical University of Dresden.
27. Newman, M. H. A. (1942), On theories with a combinatorial definition "equivalence," Ann. of Math. 43(2), 223-243.
28. Rounds, W. C. (1970), Mappings and grammars on trees, Math. Systems Theory 4, 257-287.