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 Godel'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.
Product Identifiers
Publisher
Springer-Verlag New York Inc.
ISBN-13
9780387949079
eBay Product ID (ePID)
94502333
Product Key Features
Author
Dexter C. Kozen
Publication Name
Automata and Computability
Format
Hardcover
Language
English
Subject
Computer Science
Publication Year
2007
Type
Textbook
Number of Pages
400 Pages
Dimensions
Item Height
235mm
Item Width
155mm
Item Weight
1021g
Additional Product Features
Title_Author
Dexter C. Kozen
Series Title
Undergraduate Texts in Computer Science
Country/Region of Manufacture
United States
Best Selling in Textbooks
Current slide {CURRENT_SLIDE} of {TOTAL_SLIDES}- Best Selling in Textbooks