Handbook of Automata Theory
Author | : Jean-Éric Pin |
Publisher | : |
Total Pages | : |
Release | : 2021 |
Genre | : |
ISBN | : 9783985470068 |
Download Handbook of Automata Theory Book in PDF, ePub and Kindle
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Handbook Of Automata Theory PDF full book. Access full book title Handbook Of Automata Theory.
Author | : Jean-Éric Pin |
Publisher | : |
Total Pages | : |
Release | : 2021 |
Genre | : |
ISBN | : 9783985470068 |
Author | : Manfred Droste |
Publisher | : Springer Science & Business Media |
Total Pages | : 614 |
Release | : 2009-09-18 |
Genre | : Computers |
ISBN | : 3642014925 |
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.
Author | : Manfred Droste |
Publisher | : Springer Science & Business Media |
Total Pages | : 614 |
Release | : 2009-09-18 |
Genre | : Computers |
ISBN | : 3642014925 |
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.
Author | : Jean Eric Pin |
Publisher | : |
Total Pages | : 1493 |
Release | : 2021 |
Genre | : Machine theory |
ISBN | : 9783985470020 |
Author | : Jiacun Wang |
Publisher | : CRC Press |
Total Pages | : 409 |
Release | : 2016-04-19 |
Genre | : Computers |
ISBN | : 1439846197 |
Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on fini
Author | : Wladyslaw Homenda |
Publisher | : Walter de Gruyter GmbH & Co KG |
Total Pages | : 234 |
Release | : 2022-01-19 |
Genre | : Computers |
ISBN | : 311075231X |
The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.
Author | : |
Publisher | : |
Total Pages | : 0 |
Release | : 2021 |
Genre | : |
ISBN | : 9783985475032 |
Author | : Jean Eric Pin |
Publisher | : |
Total Pages | : 0 |
Release | : 2021 |
Genre | : Machine theory |
ISBN | : |
Author | : Pin |
Publisher | : |
Total Pages | : 0 |
Release | : 2021 |
Genre | : |
ISBN | : 9783985475025 |
Author | : Erich Grädel |
Publisher | : Springer |
Total Pages | : 377 |
Release | : 2003-08-02 |
Genre | : Computers |
ISBN | : 3540363874 |
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems. For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games. The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.