503 search results - page 22 / 101 » Probabilistic Weighted Automata |
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 5 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
LMCS
2006
13 years 8 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...