default search action
3rd Graph Grammars: Warrenton, Virginia, USA, 1986
- Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld:
Graph-Grammars and Their Application to Computer Science, 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986. Lecture Notes in Computer Science 291, Springer 1987, ISBN 3-540-18771-5
Tutorial Introductions
- Hartmut Ehrig:
Tutorial introduction to the algebraic approach of graph grammars. 3-14 - Annegret Habel, Hans-Jörg Kreowski:
May we introduce to you: hyperedge replacement. 15-26 - Aristid Lindenmayer:
An introduction to parallel map generating systems. 27-40 - Manfred Nagl:
Set theoretic approaches to graph grammars. 41-54 - Grzegorz Rozenberg:
An introduction to the NLC way of rewriting graphs. 55-66 - Azriel Rosenfeld:
Array Grammars. 67-70
Technical Contributions
- Duane A. Bailey, Janice E. Cuny:
Graph Grammar Based Specification of Interconnection Structures for Massively Parallel Computation. 73-85 - Paul Boehm, Hartmut Ehrig, Udo Hummert, Michael Löwe:
Towards distributed graph grammars. 86-98 - Franz-Josef Brandenburg:
On Partially Ordered Graph Grammars. 99-111 - Bruno Courcelle:
A representation of graphs by algebraic expressions and its use for graph rewriting systems. 112-132 - Bruno Courcelle:
On context-free sets of graphs and their monadic second-order theory. 133-146 - IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg:
Restricting the complexity of regular DNLC languages. 147-166 - Joost Engelfriet, George Leih, Grzegorz Rozenberg:
Apex Graph Grammars. 167-185 - Gregor Engels, Claus Lewerentz, Wilhelm Schäfer:
Graph Grammar Engineering: A Software Specification Method. 186-201 - Patrick A. Fitzhorn:
A Linguistic Formalism for Engineering Solid Modeling. 202-215 - Herbert Göttler:
Graph grammars and diagram editing. 216-231 - Lilia Hess, Brian H. Mayoh:
Graphics and Their Grammars. 232-249 - Günter Hotz, Reiner Kolla, Paul Molitor:
On Network Algebras and Recursive Equations. 250-261 - Manfred Jackel:
ADA-Concurrency specified by Graph Grammars. 262-279 - Dirk Janssens, Grzegorz Rozenberg:
Basic notions of actor grammars: A graph grammar model for actor computation. 280-298 - Janice Jeffs:
Embedding Rule Independent Theory of Graph Grammars. 299-308 - Simon M. Kaplan, Steven K. Goering, Roy H. Campbell:
Supporting the Software Development Process with Attributed NLC Graph Grammars. 309-325 - Manfred Kaul:
Practical Applications of Precedence Graph Grammars. 326-342 - Hans-Jörg Kreowski:
Is parallelism already concurrency? Part 1: Derivations in graph grammars. 343-360 - Hans-Jörg Kreowski, Anne Wilharm:
Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars. 361-377 - Martin J. M. de Boer, Aristid Lindenmayer:
Map OL-systems with edge label control: Comparison of marker and cyclic systems. 378-392 - Jacqueline Lück, Hermann B. Lück:
From OL and IL map systems to indeterminate and determinate growth in plant morphogenesis. 393-410 - Michael G. Main, Grzegorz Rozenberg:
Fundamentals of edge-label controlled graph grammars. 411-426 - Dan I. Moldovan, Francesco Parisi-Presicce:
Parallelism analysis in rule-based systems using graph grammars. 427-439 - Ugo Montanari, Francesca Rossi:
An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints. 440-457 - Manfred Nagl:
A Software Development Environment based on Graph Technology. 458-478 - Akira Nakamura, Aristid Lindenmayer, Kunio Aizawa:
Map OL systems with markers. 479-495 - Francesco Parisi-Presicce, Hartmut Ehrig, Ugo Montanari:
Graph rewriting with unification and composition. 496-514 - Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
Complexity of pattern generation via planar parallel binary fission/fusion grammars. 515-533 - Przemyslaw Prusinkiewicz:
Applications of L-systems to computer imagery. 534-548 - Rani Siromoney:
Advances in array languages. 549-563 - Gift Siromoney, Rani Siromoney:
Rosenfeld's cycle grammars and kolam. 564-579 - Frank Wankmüller:
Application of Graph Grammars in Music Composing Systems. 580-592 - Emo Welzl:
Boundary NlC and partition controlled graph grammars. 593-609
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.