Graph Grammars and Their Application to Computer Science: 4th International Workshop Bremen, Germany, March 5–9, 1990 Proceedings

A note on hyperedge replacement....Pages 1-11
Graph grammars based on node rewriting: an introduction to NLC graph grammars....Pages 12-23
Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts....Pages 24-37
The logical expression of graph properties....Pages 38-40
Panel discussion: The use of graph grammars in applications....Pages 41-60
Graph Ed : An interactive tool for developing graph grammars....Pages 61-65
Presentation of the IPSEN-Environment: An Integrated and Incremental Project Support ENviroment....Pages 66-66
Presentation of the PROGRESS-Editor: A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems....Pages 67-67
PLEXUS: Tools for analyzing graph grammars....Pages 68-69
An algebraic theory of graph reduction....Pages 70-83
Programming with very large graphs....Pages 84-97
Describing Göttler\'s operational graph grammars with pushouts....Pages 98-112
General solution to a system of recursive equations on hypergraphs....Pages 113-126
Construction of map OL-systems for developmental sequences of plant cell layers....Pages 127-143
Layout graph grammars: The placement approach....Pages 144-156
Cycle chain code picture languages....Pages 157-173
An efficient implementation of graph grammars based on the RETE matching algorithm....Pages 174-189
An application of graph grammars to the elimination of redundancy from functions defined by schemes....Pages 190-206
Graphic equivalence and computer optimization....Pages 207-220
Graph grammars and logic programming....Pages 221-237
Graphs as relational structures : An algebraic and logical approach....Pages 238-252
Context-free handle-rewriting hypergraph grammars....Pages 253-268
From graph grammars to high level replacement systems....Pages 269-291
Algebraic specification grammars: A junction between module specifications and graph grammars....Pages 292-310
A characterization of context-free NCE graph languages by monadic second-order logic on trees....Pages 311-327
The term generating power of context-free hypergraph grammars....Pages 328-343
Elementary actions on an extended entity-relationship database....Pages 344-362
Physically-based graphical interpretation of marker cellwork L-systems....Pages 363-377
Dactl: An experimental graph rewriting language....Pages 378-395
Use graph grammars to design CAD-systems !....Pages 396-410
Collage grammars....Pages 411-429
The four musicians: analogies and expert systems — a graphic approach....Pages 430-445
Structured transformations and computation graphs for actor grammars....Pages 446-460
Grammatical inference based on hyperedge replacement....Pages 461-474
Specifying concurrent languages and systems with Δ- grammars ....Pages 475-489
Graph rewriting in some categories of partial morphisms....Pages 490-504
Application of graph grammars to rule-based systems....Pages 505-519
Tree automata, tree decomposition and hyperedge replacement....Pages 520-537
Recognizing rooted context-free flowgraph languages in polynomial time....Pages 538-548
Computing with graph relabelling systems with priorities....Pages 549-563
Double-wall cellwork systems for plant meristems....Pages 564-581
Programmed derivations of relational structures....Pages 582-598
A specification environment for graph grammars....Pages 599-609
The theory of graphoids: A survey....Pages 610-621
Graph-reducible term rewriting systems....Pages 622-636
A note on graph decimation....Pages 637-640
Progress: A VHL-language based on graph grammars....Pages 641-659
Movement of objects in configuration spaces modelled by graph grammars....Pages 660-675
Recognizing edge replacement graph languages in cubic time....Pages 676-687
Computing by graph transformation: Overall aims and new results....Pages 688-703