Articles liés à Automata Theory and Its Applications
Synopsis
Uniform treatment of the theory of finite state machines on finite and infinite strings and trees. Many books deal with automata on finite strings, but there are very few expositions that prove the fundamental results of automata on infinite strings and trees. Beginning with coverage of all standard fundamental results regarding finite automata, the book deals in great detail with Büchi and Rabin automata and their applications to various logical theories such as S1S and S2S, and describes game-theoretic models of concurrent operating and communication systems. Self-contained with numerous examples, illustrations, exercises. Suitable for a two-semester undergraduate course for computer science or math majors, or for a one-semester graduate course/seminar. No advanced mathematical background is required, thus the text is also useful for self-study by computer science professionals who wish to understand the foundations of modern formal approaches to software development, validation, and verification.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 38,83
Gratuit expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Automata Theory and Its Applications
Image d'archives
AUTOMATA THEORY AND ITS APPLICATIONS
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-72018
Quantité disponible : 5 disponible(s)
Image d'archives
Automata Theory and its Applications
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 452. N° de réf. du vendeur 26300449
Quantité disponible : 4 disponible(s)
Image d'archives
Automata Theory and its Applications
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 452 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 7547518
Quantité disponible : 4 disponible(s)
Image d'archives
Automata Theory and its Applications
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 452. N° de réf. du vendeur 18300459
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Automata Theory and Its Applications
Edité par
Birkhäuser Boston, 2001
ISBN 10 : 0817642072
ISBN 13 : 9780817642075
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 458444690
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata Theory And Its Applications
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-82930
Quantité disponible : 1 disponible(s)
Image d'archives
Automata Theory And Its Applications
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-130113
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata Theory and Its Applications
Edité par
SPRINGER NATURE Jun 2001, 2001
ISBN 10 : 0817642072
ISBN 13 : 9780817642075
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata. 432 pp. Englisch. N° de réf. du vendeur 9780817642075
Quantité disponible : 2 disponible(s)
Image d'archives
Automata Theory and its Applications
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780817642075_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata Theory and its Applications
Edité par
Birkhäuser Boston, Birkhäuser Boston Jun 2001, 2001
ISBN 10 : 0817642072
ISBN 13 : 9780817642075
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata. 452 pp. Englisch. N° de réf. du vendeur 9780817642075
Quantité disponible : 1 disponible(s)