Pages that link to "Item:Q385966"
From MaRDI portal
The following pages link to Parsing by matrix multiplication generalized to Boolean grammars (Q385966):
Displaying 21 items.
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Context-free recognition via shortest paths computation: a version of Valiant's algorithm (Q673077) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← 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)
- A reformulation of matrix graph grammars with Boolean complexes (Q2380228) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (Q5111349) (← links)
- Efficient parallel and incremental parsing of practical context-free languages (Q5371946) (← links)
- Developments in Language Theory (Q5473686) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- Formal languages over GF(2) (Q5918612) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
