panda
Computability, complexity, and languages
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvabili…
Not available to read online
This scan is restricted to patrons with print disabilities and can't be borrowed with a regular free account — signing up won't unlock it. Try Toronto Public Library, Libby, or Amazon above instead.
