Automata and Computability

Dexter C. Kozen

Informasi Dasar

20.21.284
003.3
Buku - Elektronik (E-Book)
1

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.

Subjek

COMPUTER SCIENCE
 

Katalog

Automata and Computability
978-1-4612-1844-9
407p.: pdf file.; 24 MB
English

Sirkulasi

Rp. 0
Rp. 0
Tidak

Pengarang

Dexter C. Kozen
Perorangan
 
 

Penerbit

Springer
New York
1997

Koleksi

Kompetensi

  • CII2L3 - TEORI BAHASA DAN AUTOMATA

Download / Flippingbook

 

Ulasan

Belum ada ulasan yang diberikan
anda harus sign-in untuk memberikan ulasan ke katalog ini