Handbook of Weighted Automata:
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2009
|
| Ausgabe: | 1st ed. 2009 |
| Schriftenreihe: | Monographs in Theoretical Computer Science. An EATCS Series
|
| Schlagworte: | |
| Online-Zugang: | DE-355 Volltext |
| Beschreibung: | 1 Online-Ressource (XVII, 608 Seiten 76 illus., 3 illus. in color.) |
| ISBN: | 9783642014925 |
| ISSN: | 2193-2069 |
| DOI: | 10.1007/978-3-642-01492-5 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050122736 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250115s2009 xx o|||| 00||| eng d | ||
| 020 | |a 9783642014925 |9 978-3-642-01492-5 | ||
| 024 | 7 | |a 10.1007/978-3-642-01492-5 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-642-01492-5 | ||
| 035 | |a (DE-599)BVBBV050122736 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 245 | 1 | 0 | |a Handbook of Weighted Automata |c edited by Manfred Droste, Werner Kuich, Heiko Vogler |
| 250 | |a 1st ed. 2009 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2009 | |
| 300 | |a 1 Online-Ressource (XVII, 608 Seiten 76 illus., 3 illus. in color.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Monographs in Theoretical Computer Science. An EATCS Series |x 2193-2069 | |
| 505 | 8 | |a 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 | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Computer Science Logic and Foundations of Programming | |
| 650 | 4 | |a Natural Language Processing (NLP) | |
| 650 | 4 | |a Formal Languages and Automata Theory | |
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Natural language processing (Computer science) | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Mathematical logic | |
| 700 | 1 | |a Droste, Manfred |4 edt | |
| 700 | 1 | |a Kuich, Werner |4 edt | |
| 700 | 1 | |a Vogler, Heiko |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642014918 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642014932 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642260490 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-01492-5 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-1-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2009 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035459606 | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-01492-5 |l DE-355 |p ZDB-2-SCS |q UBR Paketkauf 2024 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1821312683319754752 |
|---|---|
| adam_text | |
| any_adam_object | |
| author2 | Droste, Manfred Kuich, Werner Vogler, Heiko |
| author2_role | edt edt edt |
| author2_variant | m d md w k wk h v hv |
| author_facet | Droste, Manfred Kuich, Werner Vogler, Heiko |
| building | Verbundindex |
| bvnumber | BV050122736 |
| collection | ZDB-1-SCS |
| contents | 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 |
| ctrlnum | (ZDB-2-SCS)978-3-642-01492-5 (DE-599)BVBBV050122736 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-01492-5 |
| edition | 1st ed. 2009 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050122736</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642014925</subfield><subfield code="9">978-3-642-01492-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-01492-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-642-01492-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122736</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Handbook of Weighted Automata</subfield><subfield code="c">edited by Manfred Droste, Werner Kuich, Heiko Vogler</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 608 Seiten 76 illus., 3 illus. in color.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Monographs in Theoretical Computer Science. An EATCS Series</subfield><subfield code="x">2193-2069</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science Logic and Foundations of Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural Language Processing (NLP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal Languages and Automata Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Droste, Manfred</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kuich, Werner</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vogler, Heiko</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642014918</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642014932</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642260490</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-01492-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459606</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-01492-5</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050122736 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-15T11:05:28Z |
| institution | BVB |
| isbn | 9783642014925 |
| issn | 2193-2069 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035459606 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XVII, 608 Seiten 76 illus., 3 illus. in color.) |
| psigel | ZDB-1-SCS ZDB-2-SCS_2009 ZDB-2-SCS UBR Paketkauf 2024 |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Monographs in Theoretical Computer Science. An EATCS Series |
| spelling | Handbook of Weighted Automata edited by Manfred Droste, Werner Kuich, Heiko Vogler 1st ed. 2009 Berlin, Heidelberg Springer Berlin Heidelberg 2009 1 Online-Ressource (XVII, 608 Seiten 76 illus., 3 illus. in color.) txt rdacontent c rdamedia cr rdacarrier Monographs in Theoretical Computer Science. An EATCS Series 2193-2069 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 Theory of Computation Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Formal Languages and Automata Theory Mathematical Logic and Foundations Computer science Natural language processing (Computer science) Machine theory Mathematical logic Droste, Manfred edt Kuich, Werner edt Vogler, Heiko edt Erscheint auch als Druck-Ausgabe 9783642014918 Erscheint auch als Druck-Ausgabe 9783642014932 Erscheint auch als Druck-Ausgabe 9783642260490 https://doi.org/10.1007/978-3-642-01492-5 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Handbook of Weighted Automata 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 Theory of Computation Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Formal Languages and Automata Theory Mathematical Logic and Foundations Computer science Natural language processing (Computer science) Machine theory Mathematical logic |
| title | Handbook of Weighted Automata |
| title_auth | Handbook of Weighted Automata |
| title_exact_search | Handbook of Weighted Automata |
| title_full | Handbook of Weighted Automata edited by Manfred Droste, Werner Kuich, Heiko Vogler |
| title_fullStr | Handbook of Weighted Automata edited by Manfred Droste, Werner Kuich, Heiko Vogler |
| title_full_unstemmed | Handbook of Weighted Automata edited by Manfred Droste, Werner Kuich, Heiko Vogler |
| title_short | Handbook of Weighted Automata |
| title_sort | handbook of weighted automata |
| topic | Theory of Computation Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Formal Languages and Automata Theory Mathematical Logic and Foundations Computer science Natural language processing (Computer science) Machine theory Mathematical logic |
| topic_facet | Theory of Computation Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Formal Languages and Automata Theory Mathematical Logic and Foundations Computer science Natural language processing (Computer science) Machine theory Mathematical logic |
| url | https://doi.org/10.1007/978-3-642-01492-5 |
| work_keys_str_mv | AT drostemanfred handbookofweightedautomata AT kuichwerner handbookofweightedautomata AT voglerheiko handbookofweightedautomata |