Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/icml/ParekhH99,

 author    = {Rajesh Parekh and
              Vasant Honavar},
 title     = {Simple DFA are Polynomially Probably Exactly Learnable from
              Simple Examples},
 booktitle = {ICML},
 year      = {1999},
 pages     = {298-306},
 crossref  = {DBLP:conf/icml/1999},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}

Personal tools