Pages that link to "Item:Q1202145"

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

Displaying 21 items.

• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
• Graph grammars, insertion Lie algebras, and quantum field theory (Q904526) (← links)
• Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
• Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
• The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
• Probabilistic hyperedge replacement grammars (Q1351216) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Node replacements in embedding normal form. (Q1872709) (← links)
• Relational matching for graphical calculi of relations (Q1961869) (← links)
• Non-perturbative graph languages, halting problem and complexity (Q2171907) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• On the interleaving semantics of transformation units — A step into GRACE (Q4645269) (← links)
• Hierarchically distributed graph transformation (Q4645284) (← links)
• Graph automata for linear graph languages (Q4645286) (← links)
• Drawing graphs with attribute graph grammars (Q4645294) (← links)
• Visual Modeling of Distributed Object Systems by Graph Transformation (Q4923550) (← links)
• Path-controlled graph grammars for multiresolution image processing and analysis (Q5096271) (← links)
• Syntax and semantics of hybrid database languages (Q5096272) (← links)
• A computational model for generic graph functions (Q5096281) (← links)
• Relational structures and their partial morphisms in view of single pushout rewriting (Q5096284) (← links)
• Logic based structure rewriting systems (Q5096292) (← links)