Automata and computability
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 cla...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Sách |
| Ngôn ngữ: | Undetermined |
| Được phát hành: |
New York
Springer
1997
|
| Những chủ đề: | |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 01291nam a2200217Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_238624 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 082 | |a 511.3 | ||
| 082 | |b K88 | ||
| 100 | |a Kozen, Dexter | ||
| 245 | 0 | |a Automata and computability | |
| 245 | 0 | |c Dexter C. Kozen | |
| 260 | |a New York | ||
| 260 | |b Springer | ||
| 260 | |c 1997 | ||
| 520 | |a 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. | ||
| 526 | |a Lý thuyết tính toán | ||
| 526 | |b CTK614 | ||
| 650 | |a Lý thuyết máy,Machine theory | ||
| 910 | |b nthai | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||