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 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. The first part of the book is devoted to finite automata and their properties. Then, material on pushdown automata provides a broader class of models and enables the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and G�del's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

"About this title" may belong to another edition of this title.

Store Description

50+ Million Books in stock & ready to ship! Excellent Prices, Service & Selection.

Visit Seller's Storefront

Seller's business information

Sale & Shipping Terms

Terms of Sale

When you see an item on our listing, it means we have it available in one of our warehouses right here right now, ready for same day or next day processing of your order. Over 50+ Million books in stock & ready to ship same day. Customer Service is a top priority for us, we want every customer to be 100% satisfied. We offer the world's largest selection of books, music and video. Maintaining an accurate inventory of more than 50+ Million items, we are able to ship your order the same day it is r...

More Information