Isbn: 9780817642075 - automata theory and its applications (progress in computer science and applied logic, 21, band 21) (11 Ergebnisse)

24 x 16 cm. Zustand: 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.…

Zustand: New. pp. 452 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: 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.

Zustand: 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.

Zustand: 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.

Zustand: New. In English.

Hardcover. Zustand: Brand New. 1st edition. 430 pages. 9.50x6.50x1.25 inches. In Stock.

Zustand: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.

Buch. Zustand: 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.…

Zustand: New.

Zustand: gut. 2001. Automata Theory and its Applications (Progress in Computer Science and Applied Logic, 21, Band 21) In englischer Sprache. pages.