The following pages link to (Q3795250):
Displayed 18 items.
- The complexity of regular DNLC graph languages (Q909473) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- The monadic second-order logic of graphs : Definable sets of finite graphs (Q6203539) (← links)