Pages that link to "Item:Q1338891"
From MaRDI portal
The following pages link to Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891):
Displaying 16 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Regular description of context-free graph languages (Q676459) (← links)
- Apex graph grammars and attribute grammars (Q1112623) (← links)
- An elementary proof of double Greibach normal form (Q1209361) (← links)
- Logical description of context-free graph languages (Q1384534) (← 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)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- Context-free graph grammars: Separating vertex replacement from hyperedge repelacement (Q4284239) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- Concatenation of graphs (Q4645288) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- Node rewriting in hypergraphs (Q6550530) (← links)
