Automata and Computability

Name: Automata and Computability
ISBN: 9781461218449

Dexter C. Kozen

0 / 0

0 comments

كم أعجبك هذا الكتاب؟

ما هي جودة الملف الذي تم تنزيله؟

قم بتنزيل الكتاب لتقييم الجودة

ما هي جودة الملفات التي تم تنزيلها؟

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.

الفئات:

Mathematics - Computational Mathematics

عام:

2012

الناشر:

Springer Science & Business Media

اللغة:

english

الصفحات:

400

ISBN 10:

1461218446