The following pages link to (Q3785984):
Displaying 26 items.
- Locating the contractum in the double pushout approach (Q672236) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- Equivalence of computations in actor grammars (Q685461) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Graph grammars, insertion Lie algebras, and quantum field theory (Q904526) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Computation graphs for actor grammars (Q1208925) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Term graph rewriting and garbage collection using opfibrations (Q1331928) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Contextual nets (Q1902298) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- Non-perturbative graph languages, halting problem and complexity (Q2171907) (← links)
- Confluence theory for graphs (Q2464760) (← links)
- (Q4222788) (← links)
- The contractum in algebraic graph rewriting (Q4645265) (← links)
- The category of typed graph grammars and its adjunctions with categories of derivations (Q4645267) (← links)
- An event structure semantics for graph grammars with parallel productions (Q4645280) (← links)
- Synchronized composition of graph grammar productions (Q4645281) (← links)
- Concurrency for Graph Grammars in a Petri net shell (Q4923530) (← links)
- Graph-grammar semantics of a higher-order programming language for distributed systems (Q5096275) (← links)
- Abstract graph derivations in the double pushout approach (Q5096276) (← links)
- Set-theoretic graph rewriting (Q5096290) (← links)
- Patch Graph Rewriting (Q5100730) (← links)
- Concurrent graph and term graph rewriting (Q6162098) (← links)
