Click on a thumbnail to go to Google Books.
Loading... Automata and Computabilityby Dexter C. Kozen
None Loading...
Sign up for LibraryThing to find out whether you'll like this book. No current Talk conversations about this book. Excellent introductory text on formal language theory, with a bit on the theory of computation at the end which borders on philosophical. ( ) no reviews | add a review
Belongs to Series
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. No library descriptions found. |
Current DiscussionsNone
Google Books — Loading... GenresMelvil Decimal System (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicLC ClassificationRatingAverage:
Is this you?Become a LibraryThing Author. |