• Home /
  • Handbook of Weighted Automata

Handbook of Weighted Automata

Artikelnummer: 978-3-642-01491-8
Einband: Fester Einband
Verfügbarkeit: POD-Titel lieferbar in 5 bis 10 Arbeitstagen
CHF 273.00
decrease increase

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.

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.

Schreiben Sie Ihre eigene Bewertung
  • Nur registrierte Benutzer können Produkte bewerten
*
*
Schlecht
Sehr gut
*
*
*
*
VerlagSpringer EN
EinbandFester Einband
Erscheinungsjahr2009
Seitenangabe608 S.
AusgabekennzeichenEnglisch
AbbildungenXVII, 608 p. 76 illus., 3 illus. in color.
MasseH23.5 cm x B15.5 cm 1'213 g
CoverlagSpringer (Imprint/Brand)
ReiheMonographs in Theoretical Computer Science. An EATCS Series
AutorDroste, Manfred (Hrsg.) / Kuich, Werner (Hrsg.) / Vogler, Heiko (Hrsg.)

Alle Bände der Reihe "Monographs in Theoretical Computer Science. An EATCS Series"

Über den Autor Manfred (Hrsg.) Droste

Manfred Droste is Professor and Head of the Automata and Formal Languages Research Group in the Department of Computer Science at the University of Leipzig. His research interests include such theoretical computer science topics as automata theory, logic, algebraic models for concurrent systems, and domain theory, and such mathematical topics as model theory, automorphism groups, and ordered algebraic structures. He is editor of the Handbook of Weighted Automata.László Fuchs is the Evelyn and John G. Phillips Distinguished Professor Emeritus in Mathematics at Tulane University. He was awarded the Kossuth Prize in 1953 and is a foreign member of the Hungarian Academy of Sciences. His research interests include abelian groups, commutative domains and their modules. He is the author of numerous publications, including Abelian Groups (Springer Monographs in Mathematics). Brendan Goldsmith is Research Director at the School of Mathematical Sciences of the Dublin Institute of Technology. Formerly, he served as Head of the School of Mathematics and President of DIT. His research interests include group theory and generalizations, commutative algebra, associative rings and algebras, and mathematical logic.Lutz Strüngmann is Professor of Mathematics at the University of Duisberg-Essen. He has authored 56 publications since 1999 in the fields of group theory and generalizations, mathematical logic, commutative algebra and associative rings and algebras.

Weitere Titel von Manfred (Hrsg.) Droste

Produktbewertungen
Nur registrierte Benutzer können Produkte bewerten