PAC-learnability of Probabilistic Deterministic Finite State Automata

Alexander Clark, Franck Thollard; 5(May):473--497, 2004.

Abstract

We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAC-learning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a bound on the distinguishability between states. With this, we demonstrate that the class of PDFAs is PAC-learnable using a variant of a standard state-merging algorithm and the Kullback-Leibler divergence as error function.

[abs][pdf][ps.gz][ps]