Computability, complexity, and languages fundamentals of theoretical computer science
Davis, Martin, Sigal, Ron, Weyuker, Elaine J
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.
Categorías:
Año:
2003
Edición:
2. ed., transferred to digital print
Editorial:
Morgan Kaufman
Idioma:
english
ISBN 10:
0122063821
ISBN 13:
9780122063824
Serie:
Computer science and scientific computation
Archivo:
PDF, 48.81 MB
IPFS:
,
english, 2003