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

Name: Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science
Availability: InStock
Author: Martin D. Davis
ISBN: 9780122063800, 0122063805

by Martin D. Davis, Elaine J. Weyuker and Werner Rheinboldt (Auth.)

عنوان فارسی: محاسبه ، پیچیدگی، و زبان. اصول علم کامپیوتر نظری
ناشر: Elsevier Inc, Academic Press Inc
سال: 1983
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 425-423
شابک: 9780122063800, 0122063805
نوع فایل: PDF دانلود نرم افزار مطالعه
حجم: 16.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