Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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 have already 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. 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 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.
Similar content being viewed by others
Keywords
Table of contents (50 chapters)
-
Front Matter
-
Lectures
-
Front Matter
-
Authors and Affiliations
Bibliographic Information
Book Title: Automata and Computability
Authors: Dexter C. Kozen
Series Title: Undergraduate Texts in Computer Science
DOI: https://doi.org/10.1007/978-1-4612-1844-9
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1997
Hardcover ISBN: 978-0-387-94907-9Published: 30 April 1997
Softcover ISBN: 978-1-4612-7309-7Published: 13 October 2012
eBook ISBN: 978-1-4612-1844-9Published: 06 December 2012
Edition Number: 1
Number of Pages: XIII, 400
Topics: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity