Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples.

Rajesh Parekh Vasant G. Honavar

Published in: ICML (1999)

Keyphrases

simple examples
stochastic simulation
learning algorithm
pac learning
markov chain
np complete
sample size
learning theory
hypothesis space
dnf formulas