Pages that link to "Item:Q2656168"
From MaRDI portal
The following pages link to Uniform parsing for hyperedge replacement grammars (Q2656168):
Displaying 9 items.
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Probabilistic hyperedge replacement grammars (Q1351216) (← links)
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars (Q2278279) (← links)
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars (Q2292968) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- A Local Greibach Normal Form for Hyperedge Replacement Grammars (Q3004590) (← links)
- (Q3070891) (← links)
- Transduction from trees to graphs through folding (Q6145530) (← links)
- Tree-Based Generation of Restricted Graph Languages (Q6195089) (← links)