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

Khoussainov, Bakhadyr, Nerode, Anil

ISBN 10: 1461266459 ISBN 13: 9781461266457
Published by Birkhäuser, 2012
Used Paperback

From Mispah books, Redhill, SURRE, United Kingdom Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

AbeBooks Seller since April 15, 2021

This specific item is no longer available.

About this Item

Description:

Like New. Seller Inventory # ERICA77314612664596

Report this item

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.

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.

Bibliographic Details

Title: Automata Theory and its Applications (...
Publisher: Birkhäuser
Publication Date: 2012
Binding: Paperback
Condition: Like New
Book Type: book

Top Search Results from the AbeBooks Marketplace

Stock Image

Khoussainov, Bakhadyr
Published by Springer, 2001
ISBN 10: 1461266459 ISBN 13: 9781461266457
Used Softcover

Seller: Anybook.com, Lincoln, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9781461266457. Seller Inventory # 9641928

Contact seller

Buy Used

US$ 51.89
US$ 17.92 shipping
Ships from United Kingdom to U.S.A.

Quantity: 1 available

Add to basket

Seller Image

Bakhadyr Khoussainov|Anil Nerode
Published by Birkhäuser Boston, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Softcover

Seller: moluna, Greven, Germany

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 4189290

Contact seller

Buy New

US$ 58.52
US$ 57.54 shipping
Ships from Germany to U.S.A.

Quantity: Over 20 available

Add to basket

Stock Image

Khoussainov, Bakhadyr; Nerode, Anil
Published by Birkhäuser, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar2716030028139

Contact seller

Buy New

US$ 60.00
US$ 3.99 shipping
Ships within U.S.A.

Quantity: Over 20 available

Add to basket

Seller Image

Anil Nerode (u. a.)
Published by Birkhäuser, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Taschenbuch

Seller: preigu, Osnabrück, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Automata Theory and its Applications | Anil Nerode (u. a.) | Taschenbuch | xiv | Englisch | 2012 | Birkhäuser | EAN 9781461266457 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105724364

Contact seller

Buy New

US$ 60.92
US$ 82.22 shipping
Ships from Germany to U.S.A.

Quantity: 5 available

Add to basket

Seller Image

Anil Nerode
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. 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. 452 pp. Englisch. Seller Inventory # 9781461266457

Contact seller

Buy New

US$ 64.71
US$ 27.02 shipping
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket

Seller Image

Anil Nerode
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Taschenbuch
Print on Demand

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 452 pp. Englisch. Seller Inventory # 9781461266457

Contact seller

Buy New

US$ 64.71
US$ 70.48 shipping
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket

Stock Image

Khoussainov, Bakhadyr
Published by Birkhauser 2012-11, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9781461266457

Contact seller

Buy New

US$ 66.06
US$ 20.71 shipping
Ships from United Kingdom to U.S.A.

Quantity: 10 available

Add to basket

Seller Image

Anil Nerode
Published by Birkhäuser Boston, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. 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. Seller Inventory # 9781461266457

Contact seller

Buy New

US$ 72.56
US$ 74.47 shipping
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket

Stock Image

Bakhadyr Khoussainov
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Paperback / softback
Print on Demand

Seller: THE SAINT BOOKSTORE, Southport, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781461266457

Contact seller

Buy New

US$ 78.98
US$ 23.16 shipping
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket

Stock Image

Bakhadyr Khoussainov Anil Nerode
Published by Springer, 2012
ISBN 10: 1461266459 ISBN 13: 9781461266457
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 452. Seller Inventory # 2697521280

Contact seller

Buy New

US$ 88.97
US$ 3.99 shipping
Ships within U.S.A.

Quantity: 4 available

Add to basket

There are 2 more copies of this book

View all search results for this book