Pages that link to "Item:Q1622981"
From MaRDI portal
The following pages link to On minimal grammar problems for finite languages (Q1622981):
Displaying 11 items.
- On the grammatical complexity of finite languages (Q777998) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Lower bounds for context-free grammars (Q1944159) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- On the cover complexity of finite languages (Q2334605) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages (Q3013023) (← links)
- (Q4527054) (← links)
- (Q4599175) (← links)
- (Q5089218) (← links)