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.

Cr�ticas

"The aim of this book is to present a theory of several types of automata and applications of these facts in logic, concurrency and algebra. ...The book contains suitable material for a two-semester course for students of computer science or mathematics. It is completely self-contained and one can really enjoy reading it. It is strongly recommended for researchers and postgraduate students interested in logic, automata and/or concurrency."

--EMS

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

I mainly carry imported books from South East Asia / South Asia for readers of all Age Groups.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

PLETOS INC
6931 51st Avenue, WOODSIDE, Woodside, NY, 11377, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

We accept return for those books which are received damamged. Though we take appropriate care in packaing to avoid such situation.

Widerrufsbelehrung

Versandbedingungen

Versandkosten innerhalb von USA

Versandkosten innerhalb von USA
Bestellmenge	12 bis 19�Werktage	12 bis 14�Werktage
Erster Artikel	EUR 3.42	EUR 6.00

Die Versandzeiten werden von den Verk�uferinnen und Verk�ufern festgelegt. Sie variieren je nach Versanddienstleister und Standort. Sendungen, die den Zoll passieren, k�nnen Verz�gerungen unterliegen. Eventuell anfallende Abgaben oder Geb�hren sind von der K�uferin bzw. dem K�ufer zu tragen. Die Verk�uferin bzw. der Verk�ufer kann Sie bez�glich zus�tzlicher Versandkosten kontaktieren, um einen m�glichen Anstieg der Versandkosten f�r Ihre Artikel auszugleichen.