Rational tree relations

Bulletin of the Belgian Mathematical Society - Simon Stevin

Volumn 4, Issue 1, 1997, Pages 149-176

  Raoult, Jean Claude ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Graph grammars; Rationality; Transductions; Tree automata

Indexed keywords

EID: 0008565929     PISSN: 13701444     EISSN: None     Source Type: Journal    
DOI: 10.36045/bbms/1105730627     Document Type: Article

References (21)

1. A. Arnold, M. Dauchet, Morphismes et bimorphismes d'arbres, Theoret. Comput. Sci. 20 (1982) 33-93.
2. J. Berstel, Transduction of context-free languages, Taubner Studienbücher (1979).
3. B. Courcelle, Monadic second-order definable graph transductions: a survey, in Theoret. Comput. Sci. 126 (1994) 53-75.
4. M. Dauchet, Transductions de forêts, bimorphismes de magmoïdes, Thèse, Université de Lille 1 (1977).
5. M. Dauchet, S. Tison, Algebraic complexity of tree languages, in Tree automata and languages, M. Nivat & A. Podelski ed., Elsevier (1992).
6. M. Dauchet, S. Tison, T. Heuillard, P. Lescanne, Decidability or the confluence of ground term rewriting systems, INRIA report 675 (1987).
7. N. Dershowitz, J.-P. Jouannaud, Rewriting systems, in Handbook of Theoretical Computer Science, J. van Leeuwen ed., Elsevier (1990).
8. J. Engelfriet, Bottom-up and top-down tree transformations - a comparison, Math. Systems Theory 9 (1975) 198-231.
9. J. Engelfriet, A Greibach normal form for context-free graph grammars, Lecture Notes Comput. Sci. 623 (1992) 138-149.
10. J. Engelfriet, G. Rozenberg, G Slutzki, Tree transducers, L-systems, and two-way machines, J. Comput. Syst. Sci. 20 (1980) 150-202.
11. J. Engelfriet, H. Vogler, Modular tree transducers, Theoret. Comput. Sci. 78 (1991) 267-303.
12. F. Gecseg, M. Steinby, Tree automata, Akademiai Kiado, Budapest (1984).
13. A. Grazon, J.-C. Raoult, Equational sets of tree-vectors, IRISA report 563, Rennes (1990).
14. A. Habel, H.J. Kreowski, Characteristics of graph languages generated by edge replacement, Theoret. Comput. Sci. 51 (1987) 81-115.
15. J.E. Hopcroft, J.D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).
16. J. Mezei, J.B. Wright, Algebraic automata and context-free sets, Inform. Control 11 (1967) 3-29.
17. C. Pair, A. Quéré, Définition et étude des bilangages réguliers, Inform. Control 13 (1968) 565-593.
18. J.-C. Raoult, A survey of tree-transductions, in Tree automata and languages, M. Nivat & A. Podelski ed., Elsevier (1992) 311-326 (and report 1410 INRIA-Rennes (1991)).
19. P. P. Schreiber, Tree-transducers and syntax-connected transductions, Lecture Notes Comput. Sci. 33 (1975) 202-208.
20. M. Steinby, On certain algebraically defined tree transformations, in Proc. Coll. Math. Janos Bolyai on Algebra, Combinatorics and Logic in Computer Science, Györ, Hungary (1983) 745-764.
21. H. Vogler, Basic tree transducers, J. Comput. Syst. Sci. 34 (1987) 87-128.