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

Better World Books is the world?s leading socially conscious online bookseller and has sold over 100 million books. Each sale generates funds for global literacy. We offer low prices, fast shipping, and have a 100% money back guarantee.

Visit Seller's Storefront

Seller's business information

Better World Books Ltd
Better World Books, Third Floor, One London Square, Cross Lanes, Guildford, GU1 1UN, United Kingdom

Sale & Shipping Terms

Terms of Sale

Better World Books (BWB) values your satisfaction and offers you returns within thirty (30) days after the estimated delivery date on most items. All returned items must be in the original condition; used items should include the SKU sticker located on the spine or back of the product.

If you have an incomplete, incorrect, or damaged shipment, please contact our Customer Care team via Abebooks contact seller options before proceeding with the return.Please keep in mind that because we deal mostl...

More Information