Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
From MaRDI portal
Publication:1097866
zbMath0636.00013MaRDI QIDQ1097866
No author found.
Publication date: 1987
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68-06: Proceedings, conferences, collections, etc. pertaining to computer science
00Bxx: Conference proceedings and collections of articles
Related Items
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, On structured graph grammars. I, Nonterminal separation in graph grammars, Boundary graph grammars with dynamic edge relabeling, Theory of 2-structures. II: Representation through labeled tree families, Introduction to graph grammars with applications to semantic networks, A comparison of boundary graph grammars and context-free hypergraph grammars, Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery, Metatheorems for decision problems on hyperedge replacement graph languages, Power properties of NLC graph grammars with a polynomial membership problem, Algorithms for graph problems on BNLC structured garphs, The string generating power of context-free hypergraph grammars, Foundations of rule-based design of modular systems, Hypermap rewriting: A combinatorial approach, Context-free hypergraph grammars have the same term-generating power as attribute grammars, On hyperedge replacement and BNLC graph grammars, Separating \(k\)-separated eNCE graph languages, The complexity of connectivity problems on context-free graph languages, Probabilistic hyperedge replacement grammars, Logical description of context-free graph languages, Linear graph grammars: Power and complexity, Node replacements in embedding normal form., Relating graph and term rewriting via Böhm models, HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting, Handle-rewriting hypergraph grammars, Actor grammars, Unnamed Item, Unnamed Item
