Handbook of Weighted Automata

Handbook of Weighted Automata
Author :
Publisher : Springer Science & Business Media
Total Pages : 614
Release :
ISBN-10 : 9783642014925
ISBN-13 : 3642014925
Rating : 4/5 (925 Downloads)

Book Synopsis Handbook of Weighted Automata by : Manfred Droste

Download or read book Handbook of Weighted Automata written by Manfred Droste and published by Springer Science & Business Media. This book was released on 2009-09-18 with total page 614 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Handbook of Weighted Automata Related Books

Handbook of Weighted Automata
Language: en
Pages: 614
Authors: Manfred Droste
Categories: Computers
Type: BOOK - Published: 2009-09-18 - Publisher: Springer Science & Business Media

GET EBOOK

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite a
Handbook of Weighted Automata
Language: en
Pages: 608
Authors: Manfred Droste
Categories: Computers
Type: BOOK - Published: 2009-09-28 - Publisher: Springer

GET EBOOK

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite a
Handbook of Weighted Automata
Language: en
Pages: 608
Authors: Manfred Droste
Categories: Computers
Type: BOOK - Published: 2009-10-12 - Publisher: Springer

GET EBOOK

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite a
Elements of Automata Theory
Language: en
Pages: 818
Authors: Jacques Sakarovitch
Categories: Mathematics
Type: BOOK - Published: 2009-10-01 - Publisher: Cambridge University Press

GET EBOOK

Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal method
Mathematical Foundations of Computer Science 2010
Language: en
Pages: 730
Authors: Petr Hlineny
Categories: Computers
Type: BOOK - Published: 2010-08-10 - Publisher: Springer Science & Business Media

GET EBOOK

This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, C