E-Book, Englisch, 400 Seiten, eBook
Kozen Automata and Computability
1997
ISBN: 978-1-4612-1844-9
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 400 Seiten, eBook
Reihe: Undergraduate Texts in Computer Science
ISBN: 978-1-4612-1844-9
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Lower undergraduate
Autoren/Hrsg.
Weitere Infos & Material
Introduction * Finite Automata and Regular Sets * Pushdown Automata and Context-Free Languages * Turing Machines and Effective Computability * Homework Sets * Miscellaneous Exercises * Hints and Solutions
