Pages that link to "Item:Q4284239"
From MaRDI portal
The following pages link to Context-free graph grammars: Separating vertex replacement from hyperedge repelacement (Q4284239):
Displaying 11 items.
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars (Q1281933) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Structural properties of context-free sets of graphs generated by vertex replacement (Q1891154) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- (Q3070891) (← links)
- (Q4037335) (← links)
- (Q4852905) (← links)
- Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power (Q6487303) (← links)