ENGLISH

Automata and Computability

By Dexter C. Kozen

Book information

Publisher
Springer
Year
1997
ISBN
0387949070, 9780387949079
Language
english
Format
DJVU
Filesize
4 MB (4245269 bytes)
Series
Undergraduate Texts in Computer Science
Pages
414\414
Time added
2011-04-20 14:05:05
Информатика и вычислительная техника;Теория автома

Description

This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. 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 analyses of effective computability, decidability, and Gödel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.

Similar books