Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FCT

2009

Springer

2009

Springer

Weighted automata are ﬁnite automata with numerical weights on transitions. Nondeterministic weighted automata deﬁne quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights. We introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the ﬁrst player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata. For quantitative languages L1 and L2, we consider the pointwise operations max(L1...

Related Content

Added |
26 May 2010 |

Updated |
26 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
FCT |

Authors |
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger |

Comments (0)