The following pages link to Complexity of normal form grammars (Q799380):
Displaying 12 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Descriptional complexity of context-free grammar forms (Q1210294) (← links)
- Efficient reconfigurable embedded parsers (Q1749233) (← links)
- Greibach normal form transformation revisited. (Q1854266) (← links)
- Lower bounds for context-free grammars (Q1944159) (← links)
- Generating all permutations by context-free grammars in Chomsky normal form (Q2368945) (← links)
- Generating all permutations by context-free grammars in Greibach normal form (Q2378538) (← links)
- GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM (Q3401456) (← links)
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537) (← links)
- Greibach normal form transformation, revisited (Q5047158) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
