The minimum consistent DFA problem cannot be approximated within any polynomial


Authored By:Leonard Pitt and Manfred K. Warmuth
Paper Title:The minimum consistent DFA problem cannot be approximated within any polynomial
In:J. ACM
Number 1 Vol. 40
Publication Date: 1993
Pages:95-142