Skip to main content

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

  • 2nd Edition - February 3, 1994
  • Authors: Martin Davis, Ron Sigal, Elaine J. Weyuker
  • Language: English
  • Hardback ISBN:
    9 7 8 - 0 - 1 2 - 2 0 6 3 8 2 - 4
  • eBook ISBN:
    9 7 8 - 0 - 0 8 - 0 5 0 2 4 6 - 5

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automa… Read more

Computability, Complexity, and Languages

Purchase options

Limited Offer

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

Book bundle cover eBook and print

Institutional subscription on ScienceDirect

Request a sales quote
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.