241 search results - page 2 / 49 » Learning Classes of Probabilistic Automata |
COLT
2006
Springer
13 years 9 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
ICML
2009
IEEE
14 years 10 days ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
ALT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
FORMATS
2003
Springer
13 years 10 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...