Description
| Product ID: | 9780387949079 |
| Product Form: | Hardback |
| Country of Manufacture: | GB |
| Series: | Undergraduate Texts in Computer Science |
| Title: | Automata and Computability |
| Authors: | Author: Dexter C. Kozen |
| Page Count: | 400 |
| Subjects: | Robotics, Robotics, Mathematical theory of computation, Machine learning, Mathematical theory of computation, Machine learning |
| Description: | Select Guide Rating 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. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. 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. |
| Imprint Name: | Springer-Verlag New York Inc. |
| Publisher Name: | Springer-Verlag New York Inc. |
| Country of Publication: | GB |
| Publishing Date: | 1997-04-30 |
