Automata and Computability (Undergraduate Texts in Computer Science)
Dexter C. KozenThis 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.
Kategorie:
Rok:
2012
Wydanie:
Softcover reprint of the original 1st ed. 1997
Wydawnictwo:
Springer
Język:
english
Strony:
413
ISBN 10:
1461273099
ISBN 13:
9781461273097
Serie:
Undergraduate Texts in Computer Science
Plik:
PDF, 21.58 MB
IPFS:
,
english, 2012
Amazon 
Barnes & Noble 
Bookshop.org
Chcesz dodać księgarnię? Skontaktuj się z nami na support@z-lib.do
Konwertuj pliki
Więcej wyników wyszukiwania
Inne korzyści 
Najbardziej popularne frazy
Powiązane listy książek
