Skip to main content

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

  • 2nd Edition - October 27, 2015
  • Authors: Martin Davis, Ron Sigal, Elaine J. Weyuker
  • Language: English
  • Paperback ISBN:
    9 7 8 - 0 - 1 2 - 2 0 6 3 8 2 - 4
  • Hardback ISBN:
    9 7 8 - 1 - 4 9 3 3 - 0 0 3 4 - 1
  • 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

BACK-TO-SCHOOL

Fuel your confidence!

Up to 25% off learning resources

Elsevier academics book covers
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.

Related books