Sciweavers

160
Voted
COLT
2004
Springer
16 years 6 days 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