Sciweavers

COLT
2004
Springer
14 years 5 months ago
Learning Classes of Probabilistic Automata
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
François Denis, Yann Esposito