Pages that link to "Item:Q394967"
From MaRDI portal
The following pages link to Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967):
Displayed 25 items.
- Equations over sets of integers with addition only (Q295632) (← links)
- 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)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Language equations (Q2074222) (← links)
- Path querying with conjunctive grammars by matrix multiplication (Q2217207) (← 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)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- Generalized LR Parsing for Grammars with Contexts (Q3194708) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- Formal languages over GF(2) (Q5918612) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)