The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Expressiveness and Closure Properties for Quantitative Languages
[article]

2009
*
arXiv
*
pre-print

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. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be

arXiv:0905.2195v1
fatcat:j7zclnarwrdehdjwk4tiz4doha