Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)

Manfred Droste, Werner Kuich, Heiko Vogler

ISBN 10: 3642014917 / ISBN 13: 9783642014918

Published by Springer; 2009th edition (28 Sept. 2009), 2009

About this Item

Seller Inventory # LU-9783642014918

Bibliographic Details

• Title: Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)
• Publisher: Springer; 2009th edition (28 Sept. 2009)
• Publication Date: 2009
• Language: English
• ISBN 10: 3642014917
• ISBN 13: 9783642014918
• Binding: Hardback
• Edition: 2009th.
• Condition: New
• Dimensions: 16.51W x 4.32H x 23.88D centimeters 16.51 centimeters width by 4.32 centimeters height by 23.88 centimeters depth

About this title

Synopsis

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.

Review

From the reviews:

"This book is an excellent reference for researchers in the field, as well as students interested in this research area. The presentation of applications makes it interesting to researchers from other fields to study weighted automata. ... One of the main arguments in favor of this handbook is the completeness of its index table ― usually a faulty section in such volumes. The chapters are globally well-written and self-contained, thus pleasant to read, and the efforts put to maintain consistency in vocabulary thorough the book are very appreciable." (Michaël Cadilhac, The Book Review Column 43-3, 2012)

“The book presents a broad survey, theory and applications, of weighted automata, classical nondeterministic automata in which transitions carry weights. ... The individual articles are written by well-known researchers in the field: they include extensive lists of references and many open problems. The book is valuable for both computer scientists and mathematicians (being interested in discrete structures).” (Cristian S. Calude, Zentralblatt MATH, Vol. 1200, 2011)