Pages that link to "Item:Q3313279"
From MaRDI portal
The following pages link to On sequential and parallel node-rewriting graph grammars (Q3313279):
Displaying 14 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Parsing of edNLC-graph grammars for scene analysis (Q1114425) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system (Q5096295) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
