Computability, Complexity, and Languages, Second Edition:...

Main
Mathematics
Computability, Complexity, and...

Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Name: Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)
ISBN: 9780122063824

Martin Davis, Ron Sigal, Elaine J. Weyuker

5.0 / 5.0

0 comments

你有多喜欢这本书？

下载文件的质量如何？

下载该书，以评价其质量

下载文件的质量如何？

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.

种类:

Mathematics

年:

1994

出版:

second

出版社:

Morgan Kaufmann

语言:

english

页:

609