Computability, complexity, and languages: Fundamentals of theoretical computer science
Davis M., Sigal R., Weyuker E.
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. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.* The number of exercises included has more than tripled.* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.
种类:
年:
1994
出版:
2ed
出版社:
AP
语言:
english
页:
628
ISBN 10:
0122063821
ISBN 13:
9780122063824
系列:
Computer Science and Scientific Computing
文件:
DJVU, 3.62 MB
IPFS:
,
english, 1994