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 Unsolvability.
Materias
Ediciones (2)
- Computability, complexity, and languages (1994)
Academic Press, Harcourt, Brace · inglés
- Computability, complexity, and languages (1983)
Academic Press · inglés
