1343 search results - page 7 / 269 » Learning Weighted Automata |
IPL
2006
13 years 9 months ago
2006
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
CONCUR
2009
Springer
14 years 4 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). ...
ALT
2005
Springer
14 years 6 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
IPL
2008
13 years 9 months ago
2008
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
LATA
2010
Springer
14 years 4 months ago
2010
Springer