The following pages link to (Q4037292):
Displaying 27 items.
- On structured graph grammars. I (Q753498) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Apex graph grammars and attribute grammars (Q1112623) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- On the inference of non-confluent NLC graph grammars (Q2843997) (← links)
- (Q3152420) (← links)
- On sequential and parallel node-rewriting graph grammars, II (Q3709912) (← links)
- Non-size increasing graph rewriting for natural language processing (Q4585012) (← links)
- A category-theoretical approach to vertex replacement: The generation of infinite graphs (Q4645266) (← links)
- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290) (← links)
- Transformations of graph grammars (Q4645292) (← links)
- (Q4852905) (← links)
- GETGRATS (Q4923529) (← links)
- Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- (Q5748894) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- Node rewriting in hypergraphs (Q6550530) (← links)
