Pages that link to "Item:Q3479528"
From MaRDI portal
The following pages link to Complexity of boundary graph languages (Q3479528):
Displaying 16 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)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Bound graph polysemy (Q1574662) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Non-perturbative graph languages, halting problem and complexity (Q2171907) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
- Efficient recognition algorithms for boundary and linear eNCE graph languages (Q5941743) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
