Automata and Computability by Dexter C Kozen

Skip to product information
1 of 1

Automata and Computability by Dexter C Kozen

Summary

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.

The feel-good place to buy books
  • Free shipping in the US over $15
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • Proud to be a B Corp – A Business for good
  • Sell-back with World of Books - Sell your Books

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 Unavailable
ISBN 13 9781461273097
ISBN 10 1461273099
Title Automata and Computability
Author Dexter C Kozen
Series Undergraduate Texts In Computer Science
Condition Unavailable
Binding Type Paperback
Publisher Springer-Verlag New York Inc.
Year published 2012-10-13
Number of pages 400
Cover note Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
Note Unavailable