HOW BYOD FOR ENTERPRISE HAS CHANGED UNIVERSITY MOBILE INFRASTRUCTURE
About 85 percent of educational institutions allow their teachers or students use […]
D. C. Kozen
Hello, I'm an eBook!
ATTENTION: This item is an eBook. It can be read on iOS, Android, MAC and PC's with a supported eReader. It is not a physical book. eBooks are available via download immediately after you've checked out.
Shipped from other seller
May ship separately
Ships separately from Better World Books suppliers
Super Book Deals
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.
Get 4 popular books for only $9.50 with the Starter Pack bundle. Learn more »
Check out our Holiday Shipping chart. See Shipping Options »
The perfect last-minute gift for readers. Make Someone Happy »
We match every book you purchase with a book donation. Learn more »
Sign up now to get news, sales and special promotions!
© Better World Books (BetterWorldBooks.com)