Computability, Complexity, and Languages
|Autor:||Martin D. Davis, Ron Sigal, Elaine J. Weyuker|
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.