Random DFA's Can Be Approximately Learned from Sparse Uniform Examples

Lang. "Random DFA's Can Be Approximately Learned from Sparse Uniform Examples." Annual Conference on Computational Learning Theory, 1992. doi:10.1145/130385.130390

[Lang. "Random DFA's Can Be Approximately Learned from Sparse Uniform Examples." Annual Conference on Computational Learning Theory, 1992.](https://mlanthology.org/colt/1992/lang1992colt-random/) doi:10.1145/130385.130390

@inproceedings{lang1992colt-random,
  title     = {{Random DFA's Can Be Approximately Learned from Sparse Uniform Examples}},
  author    = {Lang, Kevin J.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1992},
  pages     = {45-52},
  doi       = {10.1145/130385.130390},
  url       = {https://mlanthology.org/colt/1992/lang1992colt-random/}
}