Loading...
research article
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.
Loading...
Name
1084.pd.pdf
Type
Publisher's version
Access type
openaccess
License Condition
CC BY-ND
Size
295.33 KB
Format
Adobe PDF
Checksum (MD5)
d4ea78df3931d443edf2f39ea7896d73