Order Total (1 Item Items):
Shipping Destination:
9780817642075 - Automata Theory and Its Applications: 21 Progress in Computer Science and Applied Logic, 21 by Khoussainov, Bakhadyr; Nerode, Anil (28 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (28)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (22)
- As New, Fine or Near Fine (3)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (24)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Automata Theory and its Applications
Seller: avelibro OHG, Dinkelscherben, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
First Edition
24 x 16 cm. Condition: Gut. 1. Auflage. XIV, 430 Seiten Innen sehr sauberer, guter Zustand. Hardcover, Pappeinband, mit den üblichen Bibliotheks-Markierungen, Stempeln und Einträgen, innen wie außen, siehe Bilder. Ecken und Kapitale etwas bestoßen und aufgerieben. - Progress in Computer Science and Applied Logic, volume 21. - Da hier 4 Exemplare angeboten werden, können die Bilder evtl. leicht abweichen. DH-30-08A Sprache: Englisch Gewicht in Gramm: 800.
-
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. pp. 452 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Condition: New. pp. 452.
-
International EditionCondition: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Condition: New. pp. 452.
-
Condition: New.
-
International Edition
Condition: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
-
Condition: As New. Unread book in perfect condition.
-
Condition: 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.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Automata Theory and its Applications (Progress in Computer Science and Applied Logic, 21, Band 21)
Language: English
Published by Birkhäuser 08.06.2001., 2001
ISBN 10: 0817642072 ISBN 13: 9780817642075
Seller: avelibro OHG, Dinkelscherben, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
Condition: Sehr gut. Auflage: 2001. XIV/430 Seiten Ausgetragenes Bibliotheksexemplar, Deckel mit leichten Gebrauchsspuren, seitlicher Schnitt mit Kulistrich B05-03-02B Sprache: Englisch Gewicht in Gramm: 785 8° 15,6 x 2,5 x 23,4 cm, Gebundene Ausgabe.
-
Automata Theory and its Applications
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.43
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Automata Theory and Its Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Automata Theory and its Applications
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2001. Hardcover. . . . . .
-
Automata Theory and Its Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Condition: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
-
Hardcover. Condition: Brand New. 1st edition. 430 pages. 9.50x6.50x1.25 inches. In Stock.
-
hardcover. Condition: Gut. 446 Seiten; 9780817642075.3 Gewicht in Gramm: 1.
-
Condition: New.
-
Automata Theory and its Applications
Language: English
Published by Birkhäuser, Birkhäuser, 2001
ISBN 10: 0817642072 ISBN 13: 9780817642075
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Automata Theory and Its Applications
Language: English
Published by SPRINGER NATURE Jun 2001, 2001
ISBN 10: 0817642072 ISBN 13: 9780817642075
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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.
-
Automata Theory and its Applications
Language: English
Published by Birkhauser Boston Inc, 2001
ISBN 10: 0817642072 ISBN 13: 9780817642075
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 58.35
£ 19.12 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Automata Theory and its Applications
Language: English
Published by Birkhäuser, Birkhäuser Jun 2001, 2001
ISBN 10: 0817642072 ISBN 13: 9780817642075
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 452 pp. Englisch.
-
Buch. Condition: Neu. Automata Theory and its Applications | Bakhadyr Khoussainov (u. a.) | Buch | Progress in Computer Science and Applied Logic | Einband - fest (Hardcover) | Englisch | 2001 | Birkhäuser | EAN 9780817642075 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand.
