ENGLISH

Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

By Martin Davis , Elaine J. Weyuker , Ron Sigal

Book information

Publisher
Morgan Kaufmann
Year
1994
ISBN
0122063821, 9780122063824
LCC
QA267 .D38 1994
Open Library ID
OL1417193M
Language
english
Format
PDF
Filesize
10 MB (10370562 bytes)
Edition
second
Pages
609\628
Time added
2012-03-09 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