Handbook of Weighted Automata (inbunden)
Fler böcker inom
Format
Häftad (Paperback)
Språk
Engelska
Serie
Monographs in Theoretical Computer Science An EATCS Series
Antal sidor
608
Utgivningsdatum
2012-03-14
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Dimensioner
234 x 156 x 32 mm
Vikt
867 g
ISBN
9783642260490

Handbook of Weighted Automata

av Manfred Droste, Werner Kuich, Heiko Vogler
Häftad,  Engelska, 2012-03-14
2425

10% rabatt på allt vid köp från 299 kr med kod LUCIA25

Gäller t.o.m. 15 december. Villkor

Köp
Spara som favorit
  • Skickas från oss inom 10-15 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Handbook of Weighted Automata Kan tyvärr inte längre levereras innan julafton.
Köp ett presentkort istället.
Finns även som
Visa alla 2 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Handbook of Weighted Automata
  2. +
  3. Groups, Modules, and Model Theory - Surveys and Recent Developments

De som köpt den här boken har ofta också köpt Groups, Modules, and Model Theory - Surveys and... av Manfred Droste, László Fuchs, Brendan Goldsmith, Lutz Strüngmann, LászlóGoldsmith Fuchs Brendan (inbunden).

Köp båda 2 för 3508 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Manfred Droste, Werner Kuich, Heiko Vogler

Du kanske gillar