The following pages link to Boolean grammars (Q1886037):
Displaying 48 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)
- 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)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- Well-founded semantics for Boolean grammars (Q840701) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Locally stratified Boolean grammars (Q948094) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Decision problems for language equations (Q972384) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Language equations (Q2074222) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Ordered context-free grammars (Q2164734) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Context-free grammars with lookahead (Q2232284) (← 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)
- Lower bound technique for length-reducing automata (Q2381504) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- The dual of concatenation (Q2575759) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- BOOLEAN FUZZY SETS (Q3401466) (← links)
- NOTES ON DUAL CONCATENATION (Q3401485) (← links)
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES (Q3538852) (← links)
- A Game-Theoretic Characterization of Boolean Grammars (Q3637237) (← links)
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS (Q5483377) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
