Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science EPUB
by Martin Davis, Ron Sigal, Elaine J. Weyuker
Part of the Computer Science and Scientific Computing series
EPUB
- Information
Description
Computability, Complexity, and Languages is an introductory text that 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.
Information
-
Download Now
- Format:EPUB
- Pages:609 pages
- Publisher:Elsevier Science
- Publication Date:18/03/1994
- Category:
- ISBN:9780080502465
Information
-
Download Now
- Format:EPUB
- Pages:609 pages
- Publisher:Elsevier Science
- Publication Date:18/03/1994
- Category:
- ISBN:9780080502465
