Pages that link to "Item:Q792097"
From MaRDI portal
The following pages link to Context-free complexity of finite languages (Q792097):
Displayed 7 items.
- A lower-bound for the number of productions required for a certain class of languages (Q1054160) (← links)
- On the context-free production complexity of finite languages (Q1098318) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- On the cover complexity of finite languages (Q2334605) (← 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)