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	Nicht verfügbar
ISBN 13	9781461273097
ISBN 10	1461273099
Titel	Automata and Computability
Autor	Dexter C Kozen
Serie	Undergraduate Texts In Computer Science
Buchzustand	Nicht verfügbar
Bindungsart	Paperback
Verlag	Springer-Verlag New York Inc.
Erscheinungsjahr	2012-10-13
Seitenanzahl	400
Hinweis auf dem Einband	Die Abbildung des Buches dient nur Illustrationszwecken, die tatsächliche Bindung, das Cover und die Auflage können sich davon unterscheiden.
Hinweis	Nicht verfügbar