#### DMCA

## The minimum consistent DFA problem cannot be approximated within any polynomial (1993)

### Cached

### Download Links

- [www.cse.ucsc.edu]
- [users.soe.ucsc.edu]
- [users.soe.ucsc.edu]
- DBLP

### Other Repositories/Bibliography

by
Leonard Pitt
,
Manfred K. Warmuth

Venue: | Journal of the Association for Computing Machinery |

Citations: | 99 - 4 self |