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 ...
Read More
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.
Read Less
Add this copy of Handbook of Weighted Automata to cart. $232.48, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
17931117197
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Monographs in Theoretical Computer Science. An EATCS Series . XVII, 608 p. Intended for college/higher education audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Handbook of Weighted Automata to cart. $234.83, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
17934505313
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Monographs in Theoretical Computer Science. An EATCS Series . XVII, 608 p. Intended for college/higher education audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
