Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
The minimum consistent DFA problem cannot be approximated within and polynomial
Home
Publications
The minimum consistent DFA problem cannot be approximated within and polynomial
The minimum consistent DFA problem cannot be approximated within and polynomial
LP
L. Pitt
L. Pitt
MW
M. K. Warmuth
M. K. Warmuth
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
1 January 1989
proceedings article
Published by
Association for Computing Machinery (ACM)
p.
421-432
https://doi.org/10.1145/73007.73048
Abstract
No abstract available
Cited by 22 articles