Automata and Computability
Dexter C. Kozen
Informasi Umum
Kode
20.21.284
Klasifikasi
003.3 - Computer science- system- computer modeling and simulation
Jenis
Buku - Elektronik (E-Book)
Subjek
Computer Science
No. Rak
Tel-U Gedung Manterawu Lantai 5 : Rak 1
Tel-U Purwokerto : Rak 1
Dilihat
190 kali
Informasi Lainnya
Abstraksi
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.
- CII2L3 - TEORI BAHASA DAN AUTOMATA
Koleksi & Sirkulasi
Tersedia 1 dari total 1 Koleksi
Anda harus log in untuk mengakses flippingbook
Pengarang
| Nama | Dexter C. Kozen |
| Jenis | Perorangan |
| Penyunting | |
| Penerjemah |
Penerbit
| Nama | Springer |
| Kota | New York |
| Tahun | 1997 |
Sirkulasi
| Harga sewa | IDR 0,00 |
| Denda harian | IDR 0,00 |
| Jenis | Non-Sirkulasi |
