Like many companies, PocketBook uses cookie technology to enhance your user experience, for analytics and marketing purposes that are to show you relevant offers, tailored the best to your interests while running this website and third parties websites. PocketBook respects your privacy rights, thus we kindly ask you to take a moment to enjoy Managing Cookie Preferences. Please take a note that strictly necessary cookies are always enabled. If you are happy with the use of all cookie files, just click Accept all cookies. To learn more about cookie technology, its benefits and how Pocketbook use it, please go to our Cookie Notice.
You can change your cookie settings at any time, using your cookie settings. You can use this page through your account. For more information about cookies and how we use them, please see our cookie notice.
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. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.
Book series:Monographs in Theoretical Computer Science. An EATCS Series