ENGLISH

Computability, complexity and languages: Fundamentals of theoretical computer science

By Davis M. , Weyuker E.

Book information

Publisher
AP
Year
1983
ISBN
0122063805, 9780122063800
LCC
QA267 .D38 1983
Open Library ID
OL3160984M
Language
english
Format
DJVU
Filesize
2 MB (2292686 bytes)
Series
Computer Science and Applied Mathematics
Pages
434\434
Library
Kolxo3
DPI
300
Time added
2011-07-22 07:35:22

Description

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.

Similar books