Pages that link to "Item:Q1112623"
From MaRDI portal
The following pages link to Apex graph grammars and attribute grammars (Q1112623):
Displaying 18 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← 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)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- (Q4694749) (← links)
- Unfolding Symbolic Attributed Graph Grammars (Q5100727) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)