Automata and Computability by Dexter C Kozen

Automata and Computability by Dexter C Kozen

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.

SKU	Non disponible
ISBN 13	9781461273097
ISBN 10	1461273099
Titre	Automata and Computability
Auteur	Dexter C Kozen
Série	Undergraduate Texts In Computer Science
État	Non disponible
Type de reliure	Paperback
Éditeur	Springer-Verlag New York Inc.
Année de publication	2012-10-13
Nombre de pages	400
Note de couverture	La photo du livre est présentée à titre d'illustration uniquement. La reliure, la couverture ou l'édition réelle peuvent varier.
Note	Non disponible