The Leading eBooks Store Online 4,410,490 members ⚫ 1,532,108 ebooks

New to

Learn more

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

Computability, Complexity, and Languages by Martin Davis
Buy this eBook
US$ 72.95
(If any tax is payable it will be calculated and shown at checkout.)
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.
Elsevier Science; March 1994
609 pages; ISBN 9780080502465
Read online, or download in secure EPUB or secure PDF format
Title: Computability, Complexity, and Languages
Author: Martin Davis; Ron Sigal; Elaine J. Weyuker