Stock Image

Automata Theory and its Applications (Progress in Computer Science and Applied Logic)

Bakhadyr Khoussainov

0 ratings by Goodreads
ISBN 10: 1461266459 / ISBN 13: 9781461266457
Published by Birkhäuser, 2012
Used Condition: Good Soft cover
From Books Express (Portsmouth, NH, U.S.A.)

AbeBooks Seller Since August 14, 2015 Seller Rating 4-star rating

Quantity Available: 1

Buy Used
Price: US$ 230.99 Convert Currency
Shipping: Free Within U.S.A. Destination, rates & speeds
Add to basket

30 Day Return Policy

About this Item

Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. May not contain Access Codes or Supplements. May be ex-library. Shipping & Handling by region. Buy with confidence, excellent customer service! Softcover reprint of the original 1st ed. 2001. Bookseller Inventory # 1461266459

Ask Seller a Question

Bibliographic Details

Title: Automata Theory and its Applications (...

Publisher: Birkhäuser

Publication Date: 2012

Binding: Paperback

Book Condition: Good

About this title

Synopsis:

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.

Review:

"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

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

Buy with confidence. Excellent customer service. 30 day return policy.

Books Express LLC
318 US Route 1, STE 2
Kittery ME 03904


Shipping Terms:

Standard and expedited shipping options include shipping and handling costs. Default shipping is by USPS Media Mail and frequently USPS Priority Mail or UPS Ground is used. Books should arrive within 10-14 business days for expedited shipping, and 20-30 business days for standard shipping. Standard shipping can on occasion take up to 30 days for delivery.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

Check Money Order PayPal Invoice Bank Draft Bank/Wire Transfer Direct Debit (Personally Authorized Payment)