Pages that link to "Item:Q385966"
From MaRDI portal
The following pages link to Parsing by matrix multiplication generalized to Boolean grammars (Q385966):
Displaying 11 items.
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Language equations (Q2074222) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
