Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Automata Theory and Its Applications

Automata Theory and Its Applications

Khoussainov, Bakhadyr
Nerode, Anil

Hardcover

Series: Progress in Computer Science and Applied Logic, Book 21

FictionMedical ReferenceGeneral Computers

ISBN10: 0817642072
ISBN13: 9780817642075
Publisher: Birkhauser
Published: Jun 8 2001
Pages: 432
Weight: 1.73
Height: 0.99 Width: 6.38 Depth: 9.52
Language: English
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.

1 different editions

Also available

Also in

General Computers

View All