503 search results - page 1 / 101 » Probabilistic Weighted Automata |
126
Voted
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
152
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
127
Voted
DLT
2009
15 years 1 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
116
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
139
Voted
ALT
2010
Springer
15 years 9 days ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...