Pages that link to "Item:Q1007613"
From MaRDI portal
The following pages link to The hardest linear conjunctive language (Q1007613):
Displaying 5 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
