Pages that link to "Item:Q1097866"

The following pages link to Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 (Q1097866):

Displaying 39 items.

• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
• On structured graph grammars. I (Q753498) (← links)
• Nonterminal separation in graph grammars (Q804300) (← links)
• Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
• Theory of 2-structures. II: Representation through labeled tree families (Q913823) (← links)
• Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
• A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
• Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
• Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
• Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
• The string generating power of context-free hypergraph grammars (Q1176107) (← links)
• Foundations of rule-based design of modular systems (Q1176249) (← links)
• Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings (Q1202145) (← links)
• On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
• Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
• The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
• Probabilistic hyperedge replacement grammars (Q1351216) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Linear graph grammars: Power and complexity (Q1825679) (← links)
• Node replacements in embedding normal form. (Q1872709) (← links)
• Relating graph and term rewriting via Böhm models (Q1924551) (← links)
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• Graph Transformations and Model-Driven Engineering: The Merits of Manfred Nagl (Q3059704) (← links)
• Actor grammars (Q3833641) (← links)
• (Q4032925) (← links)
• (Q4222788) (← links)
• On the interleaving semantics of transformation units — A step into GRACE (Q4645269) (← links)
• Pragmatic and semantic aspects of a module concept for graph transformation systems (Q4645272) (← links)
• The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
• Path-controlled graph grammars for multiresolution image processing and analysis (Q5096271) (← links)
• Jungle rewriting: An abstract description of a lazy narrowing machine (Q5096278) (← links)
• Relational structures and their partial morphisms in view of single pushout rewriting (Q5096284) (← links)
• Single pushout transformations of equationally defined graph structures with applications to actor systems (Q5096285) (← links)
• Concurrent graph and term graph rewriting (Q6162098) (← links)
• A living monograph for graph transformation (Q6535522) (← links)