Computability, complexity, and languages fundamentals of theoretical computer science

after payment (24/7)
(for all gadgets)
(including for Apple and Android)
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.
LF/222194571/R
Data sheet
- Name of the Author
- Davis
Elaine J
Martin
Ron
Sigal
Weyuker - Language
- English
- Series
- Computer science and scientific computation
- ISBN
- 9780122063824
- Release date
- 2003