Alternating Weighted Automata

Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define 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 first 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...

• Type: Conference
• Year: 2009
• Where: FCT
• Authors: Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
• Keywords: FCT 2009, Nondeterministic Weighted Automata, Theoretical Computer Science, Weighted Automata, Weighted Automata Define