Simple DFA Are Polynomially Probably Exactly Learnable from Simple Examples

Parekh and Honavar. "Simple DFA Are Polynomially Probably Exactly Learnable from Simple Examples." International Conference on Machine Learning, 1999.

[Parekh and Honavar. "Simple DFA Are Polynomially Probably Exactly Learnable from Simple Examples." International Conference on Machine Learning, 1999.](https://mlanthology.org/icml/1999/parekh1999icml-simple/)

@inproceedings{parekh1999icml-simple,
  title     = {{Simple DFA Are Polynomially Probably Exactly Learnable from Simple Examples}},
  author    = {Parekh, Rajesh and Honavar, Vasant G.},
  booktitle = {International Conference on Machine Learning},
  year      = {1999},
  pages     = {298-306},
  url       = {https://mlanthology.org/icml/1999/parekh1999icml-simple/}
}