Skip to content

Automata and Computability

Best in textbook rentals since 2012!

ISBN-10: 0387949070

ISBN-13: 9780387949079

Edition: 1997

Authors: Dexter C. Kozen

List price: $84.99
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability,…    
Customers also bought

Book details

List price: $84.99
Copyright year: 1997
Publisher: Springer New York
Publication date: 4/30/1997
Binding: Hardcover
Pages: 400
Size: 6.10" wide x 9.25" long x 0.53" tall
Weight: 2.244
Language: English

Introduction
Finite Automata and Regular Sets
Pushdown Automata and Context-Free Languages
Turing Machines and Effective Computability
Homework Sets
Miscellaneous Exercises
Hints and Solutions