The following pages link to BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280):
Displaying 6 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (Q5495419) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)