ISBN is

978-0-387-94907-9 / 0387949070

Automata and Computability (Undergraduate Texts in Computer Science)

by Kozen, Dexter C.

Publisher:Springer

Edition:Hardcover

Language:French

Prices INCLUDE standard shipping to United States
Show prices without shipping
Change shipping destination
Shipping prices may be approximate. Please verify cost before checkout.

About the book:

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.

Search under way...

Search complete.

Book rentals
More details...
120 days

ValoreBooks.com
Click on the price to find out more about a book.

New books: 1 - 25 of 58

   

Used books: 1 - 25 of 98


Book rentals: