Computability, complexity, and languages: Fundamentals of...

Main
Mathematics
Computability, complexity, and...

Computability, complexity, and languages: Fundamentals of theoretical computer science

Name: Computability, complexity, and languages: Fundamentals of theoretical computer science
ISBN: 9780122063824

Davis M., Sigal R., Weyuker E.

0 / 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

版:

2ed

出版社:

言語:

english

ページ:

628

ISBN 10: