Pages that link to "Item:Q2117261"
From MaRDI portal
The following pages link to Powerful and NP-complete: hypergraph Lambek grammars (Q2117261):
Displaying 9 items.
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Hypergraph Lambek grammars (Q2079680) (← links)
- Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
- (Q4033498) (← links)
- (Q4037317) (← links)
- Graph Transformations (Q5292608) (← links)
- Grammars based on a logic of hypergraph languages (Q6649532) (← links)