Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
Morgan Kaufmann Publishers In
Martin Davis (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
This introductory text 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.
Out of Stock
Sorry but this item is out of stock, please check back again soon.