All listings for this product
About this product
- DescriptionThis 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 Godel'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.
- Author(s)Dexter Kozen
- PublisherSpringer-Verlag New York Inc.
- Date of Publication13/10/2012
- SubjectComputing: Professional & Programming
- Series TitleUndergraduate Texts in Computer Science
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight640 g
- Width155 mm
- Height235 mm
- Spine22 mm
- Edition StatementSoftcover reprint of the original 1st ed. 1997
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $57.99Trending at AU $62.11
- AU $34.67Trending at AU $36.61
- AU $73.12Trending at AU $74.82
- AU $18.13Trending at AU $23.76
- AU $37.59Trending at AU $40.09
- AU $34.02Trending at AU $36.09
- AU $28.52Trending at AU $29.80
This item doesn't belong on this page.
Thanks, we'll look into this.