Learning Stochastic Finite Automata [chapter]

Colin de la Higuera, Jose Oncina
2004 Lecture Notes in Computer Science  
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned with approximation results, they become Pac-learnable if the L ∞ norm is used. We also investigate
more » ... that are sufficient for the class to be learnable.
doi:10.1007/978-3-540-30195-0_16 fatcat:4mlmcctfsvcnnbqnso5v4b6w34