ENGLISH

Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science

By Martin Davis , Elaine J. Weyuker

Book information

Publisher
Academic Press Inc
Year
1983
ISBN
0122063805, 9780122063800
LCC
QA267 .D38 1983
Open Library ID
OL3160984M
Language
english
Format
DJVU
Filesize
2 MB (2585717 bytes)
Series
Computer Science and Applied Mathematics
Edition
illustrated edition
Pages
435\435
DPI
300
Time added
2011-01-23 12:00:00
Математика;Дискретная математика

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