The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Leonard Pitt, Manfred K. Warmuth
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
STOC, 1989.

STOC 1989
DBLP
Scholar
DOI
Full names Links ISxN
@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,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.