The following pages link to (Q4531380):
Displaying 24 items.
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Learning Conjunctive Grammars and Contextual Binary Feature Grammars (Q2799213) (← links)
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata (Q3007638) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- Generalized LR Parsing for Grammars with Contexts (Q3194708) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- On Alternating Phrase-Structure Grammars (Q3540130) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)
- An Introduction to Grammar Convergence (Q3605471) (← links)
- A Game-Theoretic Characterization of Boolean Grammars (Q3637237) (← links)
- On Equations over Sets of Numbers and Their Limitations (Q3637239) (← links)
- On the complexity of the string generation problem (Q4809650) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- Non-closure under complementation for unambiguous linear grammars (Q6040667) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
