Basic notions of universal algebra for language theory and graph grammars

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 1-54

  Courcelle, Bruno ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; SET THEORY; TREES (MATHEMATICS);

EQUATIONAL SUBSETS; FINITE GRAPHS; FINITE HYPERGRAPHS; FINITE TREES; UNIVERSAL ALGEBRA;

COMPUTATIONAL LINGUISTICS;

EID: 0030216678     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00145-X     Document Type: Review

References (48)

1. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, J. ACM 40 (1993) 1134-1164.
2. S. Arnbor, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991) 308-340.
3. A. Arnold and M. Dauchet Un théorème de duplication pour les forêts algébriques, J. Comput. System Sci. 13 (1976) 223-244.
4. A. Arnold and D. Niwinski, Fixed-point characterization of weak monadic logic definable sets of trees, in: M. Nivat and A. Podelski, eds., Tree Automata and Languages (Elsevier, Amsterdam, 1992) 159-188.
5. M. Bauderon and B. Courcelle, Graph rewriting and graph expressions, Math. Systems Theory 20 (1987) 83-127.
6. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos. Soc. 29 (1935) 433-454.
7. N. Bourbaki, Algèbre, Chapitre 1, Hermann, Paris, 1970.
8. D. Bruschi, G. Pighizzini and N. Sabadini, On the existence of minimum asynchronous automata and on the equivalence problem for unambigous regular trace languages. Inform. Comput. 108 (1994) 262-285.
9. R. Cori, Y. Métivier and W. Zielonka, Asynchronous mappings and asynchronous cellular automata, Inform. Comput. 106 (1993) 159-203
10. B. Courcelle, Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theoret. Comput Sci. 42 (1986) 1-122.
11. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987) 141-181.
12. B. Courcelle, On recognizable sets and tree-automata, in: M. Nivat and H. Ait-Kaci, eds. Resolution of Equations in Algebraic Structures, Vol. 1 (Academic Press, New York, 1989) 93-126
13. B. Courcelle, Graph rewriting: an algebraic and logic approach, in J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 193-242.
14. B. Courcelle, Recursive applicative program schemes, in J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 460-492.
15. B. Courcelle, The monadic second-order logic of graphs I, Recognizable sets of finite graphs, Inform. Comput. 85 (1990) 12-75.
16. B. Courcelle, The monadic second-order logic of graphs V, On closing the gap between definability and recognizability, Theoret. Comput. Sci. 80 (1991) 153-202.
17. B. Courcelle, The monadic second-order logic of graphs VII, Graphs as relational structures, Theoret. Comput. Sci. 101 (1992) 3-33.
18. B. Courcelle, Recognizable sets of unrooted trees, in: M. Nivat and A. Podelski eds., Tree Automata and Languages (Elsevier, Amsterdam, 1992) 141-157.
19. B. Courcelle, Graph grammars, monadic second-order logic, and the theory of graphs minors, in: N. Robertson and P. Seymour, eds., Graph structure theory, Contemporary Mathematics 147 (1993) 565-590.
20. B. Courcelle, Recognizable sets of graphs: equivalent definitions and closure properties, Math. Struct. Comput. Sci. 4 (1994) 1-32.
21. B. Courcelle, Structural properties of sets of hypergraphs generated by vertex replacement, Inform. Comput. 116 (1995) 275-293.
22. B. Courcelle, J. Engelfriet and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993) 218-270.
23. B. Courcelle and M. Mosbah, Monadic second-order evaluation of tree-decomposable graphs, Theoret. Comput. Sci. 109 (1993) 49-82.
24. W. Damm, The IO and OI hierarchies, Theoret. Comput. Sci. 20 (1982) 95-207.
25. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 243-320.
26. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specifications 1: Equations and Initial Semantics (Springer, Berlin 1985).
27. S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1974).
28. J. Engelfriet and E. Schmidt, IO and OI, J. Comput. System Sci. 15 (1977) 328-353 and 16 (1978) 67-99.
29. J. Engelfriet and E. Schmidt, IO and OI, J. Comput. System Sci. 15 (1977) 328-353 and 16 (1978) 67-99.
30. F. Gecseg and M. Steinby, Tree-automata (Akademiai Kiado, Budapest, 1984).
31. S. Ginsburg and H. Rice, Two families of languages related to ALGOL, J. ACM 9 (1962) 350-371.
32. J. Goguen, J. Thatcher, E. Wagner and J. Wright, Initial algebra semantics and continuous algebras, J. ACM 24 (1977) 68-95.
33. I. Guessarian, Algebraic semantics, Lecture Notes in Computer Science, Vol. 99 (Springer, Berlin, 1981).
34. A. Habel, Hyperedge replacement: grammars and languages, Lecture Notes in Computer Science, Vol. 643 (Springer, Berlin, 1992).
35. J. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay, T. Maibaum, eds., Handbook of Logic in Computer Science, Vol. 2 (Oxford University Press, Oxford, 1992) 1-116.
36. J.-L. Lassez, Y. Nguyen and E. Sonenberg, Fixed-point theorems and semantics: a folk tale, Inform. Proc. Lett. 14 (1982) 112-116.
37. A. Lazrek, P. Lescanne and J.-J. Thiel, Tools for proving inductive equalities, relative completeness and ω-completeness, Inform. Comput. 84 (1990) 47-70.
38. E. Leiss, On generalized language equations, Theoret. Comput. Sci. 14 (1981) 63-77.
39. J. Mezei and J. Wright, Algebraic automata and context-free sets, Inform. Control 11 (1967) 3-29.
40. D. Niwinski, Fixed points vs. infinite generation, Proc. 3rd Symp. on Logic In Computer Science (1988) 402-409.
41. M. Pelletier and J. Sakarovich, Easy multiplications II: extensions of rational monoids, Inform. Comput. 74 (1987) 173-197.
42. D. Pilling, Commutative regular equations and Parikh's theorem, J. London Math. Soc. 6 (1973) 663-666.
43. J. Sakarovich, Easy multiplications I: the realm of Kleene's Theorem, Inform. Comput. 74 (1987) 173-197.
44. M. Steinby, Some algebraic aspects of recognizability and rationality, Lecture Notes in Computer Science, Vol. 117 (Springer, Berlin, (1981) 360-372.
45. M. Tajine, Décidabilité de l'ω-complétude des spécifications algébriques par des axiomes égalitaires clos, Université L. Pasteur, Strasbourg, France, Report 92/19, 1992.
46. W. Wechler, Universal Algebra for Computer Scientists (Springer, Berlin, 1992).
47. M. Wirsing, Algebraic specifications, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 675-779.
48. W. Zielonka, Notes on finite asynchronous automata, RAIRO Inform. Théortique Appl. 21 (1987) 99-135.