The following pages link to A tale of conjunctive grammars (Q1622943):
Displaying 14 items.
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- Top-down parsing of conjunctive languages (Q1604833) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- (Q2968416) (← links)
- (Q3493233) (← links)
- An Introduction to Grammar Convergence (Q3605471) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- Non-closure under complementation for unambiguous linear grammars (Q6040667) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
- Rational index of languages defined by grammars with bounded dimension of parse trees (Q6580079) (← links)