Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings (Q1202145)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Drewes, Frank; Kreowski, Hans-Jörg}, A note on hyperedge replacement, 1-11 [Zbl 0765.68086] \textit{Engelfriet, Joost; Rozenberg, Grzegorz}, Graph grammars based on node rewriting: An introduction to NLC graph grammars, 12-23 [Zbl 0765.68091] \textit{Ehrig, Hartmut; Korff, Martin; Löwe, Michael}, Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts, 24-37 [Zbl 0765.68089] \textit{Courcelle, Bruno}, The logical expression of graph properties, 38-40 [Zbl 0765.68158] \textit{Himsolt, Michael}, Graph\(^{Ed}\): An interactive tool for developing graph grammars, 61-65 [Zbl 0765.68093] \textit{Schürr, Andy}, IPSEN-environment: An integrated and incremental project support environment, 66 [Zbl 0765.68154] \textit{Schürr, Andy}, PROGRESS-editor: A text-oriented hybrid editor for programmed graph rewriting systems, 67 [Zbl 0765.68066] \textit{Wanke, Egon}, PLEXUS: Tools for analyzing graph grammars, 68-69 [Zbl 0765.68099] \textit{Arnborg, Stefan; Courcelle, Bruno; Proskurowski, Andrzej; Seese, Detlef}, An algebraic theory of graph reduction, 70-83 [Zbl 0765.68062] \textit{Bailey, Duane A.; Cuny, Janice E.; Fisher, Charles D.}, Programming with very large graphs, 84-97 [Zbl 0765.68077] \textit{Barthelmann, Klaus}, Describing Göttler's operational graph grammars with pushouts, 98-112 [Zbl 0765.68078] \textit{Bauderon, Michel}, General solution to a system of recursive equations on hypergraphs, 113-126 [Zbl 0771.05072] \textit{de Boer, Martin J. M.}, Construction of map OL-systems for developmental sequences of plant cell layers, 127-143 [Zbl 0765.68063] \textit{Brandenburg, Franz J.}, Layout graph grammars: The placement approach, 144-156 [Zbl 0765.68080] \textit{Brandenburg, Franz J.; Chytil, Michal P.}, Cycle chain code picture languages, 157-173 [Zbl 0765.68079] \textit{Bunke, H.; Glauser, T.; Tran, T.-H.}, An efficient implementation of graph grammars based on the RETE matching algorithm, 174-189 [Zbl 0765.68081] \textit{Caucal, Didier}, An application to the graph grammars to the elimination of redundancy from functions defined by schemes, 190-206 [Zbl 0765.68082] \textit{Chen, Tien Chi}, Graphic equivalence and computer optimization, 207-220 [Zbl 0765.68163] \textit{Corradini, Andrea; Montanari, Ugo; Rossi, Francesca; Ehrig, Hartmut; Löwe, Michael}, Graph grammars and logic programming, 221-237 [Zbl 0765.68083] \textit{Courcelle, Bruno}, Graphs as relational structures: An algebraic and logical approach, 238-252 [Zbl 0765.68085] \textit{Courcelle, Bruno; Engelfriet, Joost; Rozenberg, Grzegorz}, Context-free handle-rewriting hypergraph grammars, 253-268 [Zbl 0765.68084] \textit{Ehrig, Hartmut; Habel, Annegret; Parisi-Presicce, Francesco}, From graph grammars to high level replacement systems, 269-291 [Zbl 0765.68088] \textit{Ehrig, Hartmut; Parisi-Presicce, Francesco}, Algebraic specification grammars: A junction between module specifications and graph grammars, 292-310 [Zbl 0765.68087] \textit{Engelfriet, Joost}, A characterization of context-free NCE graph languages by monadic second- order logic on trees, 311-327 [Zbl 0765.68090] \textit{Engelfriet, Joost; Heyker, Linda}, The term generating power of context-free hypergraph grammars, 328-343 [Zbl 0765.68092] \textit{Engels, Gregor}, Elementary actions on an extended entity-relationship database, 344-362 [Zbl 0765.68030] \textit{Fracchia, F. David; Prusinkiewicz, Przemyslaw}, Physically-based graphical interpretation of marker cellwork L-systems, 363-377 [Zbl 0770.92010] \textit{Habel, Annegret; Kreowski, Hans-Jörg}, Collage grammars, 411-429 [Zbl 0768.68081] \textit{Janssens, D.; Rozenberg, G.}, Structured transformations and computation graphs for actor grammars, 446-460 [Zbl 0900.68292] \textit{Jeltsch, Eric; Kreowski, Hans-Jörg}, Grammatical inference based on hyperedge replacement, 461-474 [Zbl 0768.68082] \textit{Kennaway, Richard}, Graph rewriting in some categories of partial morphisms, 490-504 [Zbl 0765.68065] \textit{Korff, Martin}, Application of graph grammars to rule-based systems, 505-519 [Zbl 0765.68096] \textit{Lautemann, Clemens}, Tree automata, tree decomposition and hyperedge replacement, 520-537 [Zbl 0765.68160] \textit{Lichtblau, Ulrike}, Recognizing rooted context-free flowgraph languages in polynomial time, 538-548 [Zbl 0765.68097] \textit{Litovsky, Igor; Métivier, Yves}, Computing with graph relabelling systems with priorities, 549-563 [Zbl 0765.68161] \textit{Lück, Jacqueline; Lück, Hermann B.}, Double-wall cellwork systems for plant meristems, 564-581 [Zbl 0770.92011] \textit{Maggiolo-Schettini, Andrea; Winkowski, Józef}, Programmed derivations of relational structures, 582-598 [Zbl 0768.68071] \textit{Paz, Azaria}, The theory of graphoids: A survey, 610-621 [Zbl 0769.68075] \textit{Plump, Detlef}, Graph-reducible term rewriting systems, 622-636 [Zbl 0787.68058] \textit{Rosenfeld, Azriel}, A note on graph decimation, 637-640 [Zbl 0787.68059] \textit{Taentzer, Gabriele; Schween, Holger}, Movement of objects in configuration spaces modelled by graph grammars, 660-675 [Zbl 0769.68077] \textit{Vogler, Walter}, Recognizing edge replacement graph languages in cubic time, 676-687 [Zbl 0769.68078] \textit{Ehrig, Hartmut; Löwe, Michael}, Computing by graph transformation: Overall aims and new results, 688-703 [Zbl 0900.68325]