Pages that link to "Item:Q918718"
From MaRDI portal
The following pages link to A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718):
Displayed 25 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← 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)
- 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)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- (Q4852905) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)