Automata and Computability (Undergraduate Texts in Computer Science)
- List Price:
- Sale Price: $60.73
- Amount Saved: $24.22
- Availability: Usually ships in 1-2 business days
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. 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 analyses of effective computability, decidability, and Gödel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.
- Product Dimensions: 7.01 x 0.94 x 10 inches; 1.95 pounds
- Shipping Weight: 1.95 pounds
- ASIN: 0387949070
- Item model number:
- Average Customer Review: Customer Reviews
Customers Who Viewed This Item Also Viewed
Write a Reply or Comment:
You must be logged in to post a comment.