Expressiveness And Closure Properties For Quantitative Languages

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 the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages.


Published in:
Logical Methods In Computer Science, 6, -
Year:
2010
Keywords:
Laboratories:




 Record created 2011-12-16, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)