Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
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

Rajesh Parekh, Vasant Honavar
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
ICML, 1999.

ICML 1999
DBLP
Scholar
Full names Links ISxN
@inproceedings{ICML-1999-ParekhH,
	author        = "Rajesh Parekh and Vasant Honavar",
	booktitle     = "{Proceedings of the 16th International Conference on Machine Learning}",
	isbn          = "1-55860-612-2",
	pages         = "298--306",
	publisher     = "{Morgan Kaufmann}",
	title         = "{Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples}",
	year          = 1999,
}

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.