Random DFA's can be approximately learned from sparse uniform examples. Lang, K. J. In Proceedings of the Fifth ACM Workshop on Computational Learning Theory, 1996.
bibtex   
@inproceedings{Lang:92,
author= {K. J. Lang},
title  = {Random DFA's can be approximately learned from sparse uniform examples},
booktitle =
{Proceedings of the Fifth ACM Workshop on Computational Learning Theory},
publisher={},
year = {1996}}

Downloads: 0