Pages that link to "Item:Q840701"
From MaRDI portal
The following pages link to Well-founded semantics for Boolean grammars (Q840701):
Displaying 17 items.
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- A game-theoretic characterization of Boolean grammars (Q631778) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Language equations (Q2074222) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
