Pages that link to "Item:Q2334605"
From MaRDI portal
The following pages link to On the cover complexity of finite languages (Q2334605):
Displaying 11 items.
- Cover complexity of finite languages (Q777997) (← links)
- On the grammatical complexity of finite languages (Q777998) (← links)
- On the context-free production complexity of finite languages (Q1098318) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- Fine covers of a VAS language (Q1186433) (← links)
- On minimal grammar problems for finite languages (Q1622981) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- (Q3370005) (← links)
- (Q3779781) (← links)
- (Q4540971) (← links)
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES (Q5696954) (← links)