Handbook of Weighted Automata by Manfred Droste (.PDF)
File Size: 3 MB
Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series) by Manfred Droste, Werner Kuich, Heiko Vogler
Requirements: .PDF reader, 3 MB
Overview: The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios.
Genre: Non-Fiction > Tech & Devices
Free Download links: