Sciweavers

ICGI
2004
Springer

Learning Stochastic Finite Automata

13 years 7 months ago
Learning Stochastic Finite Automata
Abstract. 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 queries that are sufficient for the class to be learnable.
Colin de la Higuera, José Oncina
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ICGI
Authors Colin de la Higuera, José Oncina
Comments (0)