Automata and Computability - Undergraduate Texts in Computer Science (Paperback)Dexter C. Kozen (author)
- Temporarily unavailable
Stay one step ahead and let us notify you when this item is next available to order
We will contact you when this item is next available to order.
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 Goedel'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.
Publisher: Springer-Verlag New York Inc.
Number of pages: 400
Weight: 640 g
Dimensions: 235 x 155 x 22 mm
Edition: Softcover reprint of the original 1st ed. 199
You may also be interested in...
Would you like to proceed to the App store to download the Waterstones App?
Alternatively, for multiple items you may find it easier to add to basket, then pay online and collect in as little as 2 hours, subject to availability.