دانلود کتاب Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Second Edition

Name: Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Second Edition
Availability: InStock
Author: Martin Davis
ISBN: 0122063821

by Martin Davis, Ron Sigal, Elaine J. Weyuker

عنوان فارسی: محاسبه، پیچیدگی، و زبان ها: اصول نظری علوم کامپیوتر، چاپ دوم
ویرایش: 2
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 628-628
شابک: 0122063821
نوع فایل: DJVU دانلود نرم افزار مطالعه
حجم: 4.00 مگابایت

گزارش تخلف

دانلود کتاب

افزودن خلاصه فارسی

جزییات کتاب

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.* The number of exercises included has more than tripled.* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

گزارش اشکال ⚠