Pages that link to "Item:Q1825679"
From MaRDI portal
The following pages link to Linear graph grammars: Power and complexity (Q1825679):
Displaying 27 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Nonterminal bounded NLC graph grammars (Q1114416) (← 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)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
