The following pages link to Context-free graph grammars (Q4155839):
Displayed 10 items.
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998) (← links)
- Graph grammars with neighbourhood-controlled embedding (Q1165019) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Using attributed flow graph parsing to recognize clichés in programs (Q4645274) (← links)