Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
ICML, pp. 298-306, 1999.
Efficient learning of DFA is a challengingresearch problem in grammatical inference.Both exact and approximate (in the PACsense) identifiability of DFA from examplesis known to be hard. Pitt, in his seminalpaper posed the following open researchproblem: "Are DFA PAC-identifiable if examplesare drawn from the uniform distribution,or ...More
PPT (Upload PPT)