Weighted automata

Abstract

Weighted automata are classical finite automata in which the transitions carry weights. 7 These weights may model quantitative properties like the amount of resources needed for executing 8 a transition or the probability or reliability of its successful execution. Using weighted automata, 9 we may also count the number of successful paths labeled by a given word. 10 As an introduction into this field, we present selected classical and recent results concentrating 11 on the expressive power of weighted automata. 12 2 M. Droste, D. Kuske