Concatenation of graphs

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

Volumn 1073, Issue , 1996, Pages 368-382

  Engelfriet, Joost ^a   Vereijken, Jan Joris ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; GRAPH THEORY;

AS GRAPH; GRAPH LANGUAGES; HYPEREDGE REPLACEMENT; REGULAR GRAPHS; STRING LANGUAGES;

VISUAL LANGUAGES;

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

References (22)

1. M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Math. Syst. Theory 20 (1987), 83-127
2. D. B Benson; The basic algebraic structures in categories of derivations, Inf. and Control 28 (1975), 1-29
3. J. Berstel; Transduetions and Context-Free Languages, Teubner, Stuttgart, 1979
4. F. Bossut, M. Dauchet, B. Warin; A Kleene theorem for a class of planar acyclic graphs, Inf. and Comp. 117 (1995), 251-265
5. V. Claus; Ein Vollst~ndigkeitssatz ffir Programme und Schaltkreise, Acta Informatica 1 (1971), 64-78
6. B. Courcelle; Graph rewriting: an algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. B (J. van Leeuwen, ed.), Elsevier, 1990, pp. 193-242
7. B. Courcelle, J. Engelfriet, G. Rozenberg; Handle-rewriting hypergraph languages, J. of Comp. Syst. Sci. 46 (1993), 218-270
8. F. Drewes; Transducibility-symbolic computation by tree-transductions, University of Bremen, Bericht Nr. 2/93, 1993
9. H. Ehrig, K. -D. Kiermeier, H. -J. Kreowski, W. Kiihnel; Universal Theory of Automata, Teubner, Stuttgart, 1974
10. J. Engelfriet; Graph grammars and tree transducers, Proc. CAAP'94 (S. Tison, ed.), Lecture Notes in Computer Science 787, Springer-Verlag, Berlin, 1994, pp. 15-36
11. J. Engelfriet, L. M. Heyker; The string generating power of context-free hypergraph grammars, J. of Comp. Syst. Sci. 43 (1991), 328-360
12. J. Engelfriet, L. M. Heyker, G. Leih; Context-free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31 (1994), 341-378
13. J. Engelfriet, G. Rozenberg, G. Slutzki; Tree transducers, L systems, and twoway machines, J. of Comp. Syst. Sci. 20 (1980), 150-202
14. J. Engelfriet, J. J. Vereijken; Context-free graph grammars and concatenation of graphs, Report 95-27, Leiden University, September 1995
15. F. Gécseg, M. Steinby; Tree Automata, Akadémiai Kiadó, Budapest, 1984
16. S. Greibach; One-way finite visit automata, Theor. Comput. Sci. 6 (1978), 175-221
17. A. Habel; I-Iyperedge Replacement: Grammars and Languages, Lecture Notes in Computer Science 643, Springer-Verlag, Berlin, 1992
18. G. Hotz; Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK 1 (1965), 185-205, 209-231
19. G. Hotz; Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, EIK 2 (1966), 235-246
20. G. Hotz, R. Kolla, P. Molitor; On network algebras and recursive equations, in Graph-Grammars and Their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, eds.), Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, pp, 250-261
21. V. Rajlich; Absolutely parallel grammars and two-way finite state transducers, J. of Comp. Syst. Sci. 6 (1972), 324-342
22. A. Salomaa; Formal Languages, Academic Press, New York, 1973