Leonard Pitt, Manfred K. Warmuth. The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 15-17 May 1989, Seattle, Washington, USA. pages 421-432, ACM, 1989.
Abstract is missing.