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 7 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← 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)
