Graph grammars with negative application conditions

Fundamenta Informaticae

Volumn 26, Issue 3-4, 1996, Pages 287-313

  Habel, Annegret ^a   Heckel, Reiko ^b   Taentzer, Gabriele ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Application conditions; Contextual conditions; Graph grammars; Graph transformation systems

Indexed keywords

COMPUTATIONAL GRAMMARS; CONTEXT SENSITIVE GRAMMARS; MATHEMATICAL TRANSFORMATIONS; RECURSIVE FUNCTIONS;

APPLICATION CONDITIONS; CONTEXT CONDITIONS; DERIVATIONS; EMBEDDING RESTRICTIONS; GENERATIVE POWER; GRAPH GRAMMARS; MORPHISMS; NODES; PARALLELISM THEOREM;

GRAPH THEORY;

EID: 0030172972     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-263404     Document Type: Article

References (25)

1. Jiří Adámek, Horst Herrlich, George Strecker. Abstract and Concrete Categories. John Wiley & Sons, New York, 1990.
2. Michael A. Arbib, Ernest G. Manes. Arrows, Structures, and Functors. Academic Press, New York, 1975.
3. Paul Böhm, Harald-Reto Fonio, Annegret Habel. Amalgamation of graph transformations: A synchronization mechanism. Journal of Computer and System Sciences 34, 377-408, 1987.
4. Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, G. Rozenberg, eds., Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, 155-166, 1979.
5. Horst Bunke. On the generative power of sequential and parallel programmed graph grammars. Computing 29, 89-112, 1982.
6. Erzsébet Csuhaj-Varjú. On grammars with local and global context conditions. Intern. J. Computer Math. 47, 17-27, 1993.
7. Jürgen Dassow, Gheorghe Pǎun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1989.
8. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, G. Rozenberg, eds., Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, 1-69, 1979.
9. Hartmut Ehrig, Annegret Habel. Graph grammars with application conditions. In G. Rozenberg, A. Salomaa, eds., The Book of L, 87-100. Springer-Verlag, Berlin, 1986.
10. Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce. Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science 1, 361-404, 1991.
11. Hartmut Ehrig, Michael Löwe. Categorical Principles, Techniques and Results for High-Level-Replacement Systems in Computer Science. In Applied Categorical Structures, volume 1, 1993. Kluwer Academic Publishers.
12. Hartmut Ehrig, Michael Löwe. Parallel and distributed derivations in the single-pushout approach. Theoretical Computer Science 109, 123-143, 1993.
13. Joseph A. Goguen, Rod Burstall. Institutions, Abstract Model Theory for Specification and Programming. JACM, January 1990
14. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
15. Hans-Jörg Kreowski. Five facets of hyperedge replacement beyond context-freeness. In Z. Ésik, ed., Fundamentals of Computation Theory, Lecture Notes in Computer Science 710, 69-86, 1993.
16. Hans-Jörg Kreowski, Grzegorz Rozenberg. On structured graph grammars, I and II. Information Sciences 52, 185-210 and 221-246, 1990.
17. Igor Litovsky, Yves Métivier. Computing with graph rewriting systems with priorities. Theoretical Computer Science 115, 191-224, 1993.
18. Michael Löwe. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 181-224, 1993.
19. Ugo Montanari. Separable graphs, planar graphs and web grammars. Information and Control 16, 243-267, 1970.
20. John L. Pfaltz, Azriel Rosenfeld. Web grammars. In Int. Joint Conference on Artificial Intelligence, 609-619, 1969.
21. Terrence W. Pratt. Pair grammars, graph languages and string-to-graph translations. Journal of Computer and System Sciences 5, 560-595, 1971.
22. Arto K. Salomaa. Formal Languages. Academic Press, New York, 1973.
23. Andy Schürr. PROGRESS: A VHL-Language Based on Graph Grammars. Lecture Notes in Computer Science, 532, 641-659, 1991.
24. S.H. von Solms. Node-label controlled graph grammars with context conditions. Intern. J. Computer Math. 15, 39-49, 1984.
25. Frank Wankmüller. Characterization of graph classes by forbidden structures and reductions. Lecture Notes in Computer Science 153, 405-414, 1983.