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. – 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.
€50.13
购买此电子书可免费获赠一本！
语言 英语 ● 格式 EPUB ● ISBN 9780080502465 ● 出版者 Elsevier Science ● 发布时间 1994 ● 下载 6 时 ● 货币 EUR ● ID 2587281 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器
来自同一作者的更多电子书 / 编辑
48,995 此类电子书
