01291nam a2200217Ia 4500 CTU_238624 210402s9999 xx 000 0 und d 511.3 K88 Kozen, Dexter Automata and computability Dexter C. Kozen New York Springer 1997 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 Gö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. Lý thuyết tính toán CTK614 Lý thuyết máy,Machine theory nthai Trung tâm Học liệu Trường Đại học Cần Thơ