The following pages link to (Q4531380):
Displaying 50 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)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- A game-theoretic characterization of Boolean grammars (Q631778) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← 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)
- Grammatical unification (Q789185) (← 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)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- Locally stratified Boolean grammars (Q948094) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Decision problems for language equations (Q972384) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- The hardest linear conjunctive language (Q1007613) (← links)
- Separating systems of conjunctions. (Q1130118) (← links)
- A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337) (← links)
- Probabilistic conjunctive grammar (Q1683542) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Boolean grammars (Q1886037) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Language equations (Q2074222) (← links)
- Path querying with conjunctive grammars by matrix multiplication (Q2217207) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Distributional learning of conjunctive grammars and contextual binary feature grammars (Q2424694) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- The dual of concatenation (Q2575759) (← links)
