## Leonard Pitt, Manfred K. Warmuth

*The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial*

STOC, 1989.

@inproceedings{STOC-1989-PittW, author = "Leonard Pitt and Manfred K. Warmuth", booktitle = "{Proceedings of the 21st Annual ACM Symposium on Theory of Computing}", doi = "10.1145/73007.73048", isbn = "0-89791-307-8", pages = "421--432", publisher = "{ACM}", title = "{The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial}", year = 1989, }