Computability, Complexity, and Languages, 2nd Edition
Fundamentals of Theoretical Computer Science
By Martin Davis, Ron Sigal, Elaine J. Weyuker
Publisher: Elsevier / Morgan Kaufmann
Final Release Date: March 1994
Pages: 609

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.

Product Details
Recommended for You
Customer Reviews
 
Buy 2 Get 1 Free Free Shipping Guarantee
Buying Options
Immediate Access - Go Digital what's this?
Ebook:  $110.00
Formats:  ePub, Mobi, PDF