Automata, Computability and Complexity pdf epub mobi txt 電子書 下載 2024


Automata, Computability and Complexity

簡體網頁||繁體網頁
Elaine A. Rich
Prentice Hall
2007-09-28
1120
USD 129.00
Hardcover
9780132288064

圖書標籤: 計算理論  CS  textbook  邏輯  計算機  求這本書電子版。  999   


喜歡 Automata, Computability and Complexity 的讀者還喜歡




點擊這裡下載
    


想要找書就要到 小哈圖書下載中心
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

发表于2024-06-15

Automata, Computability and Complexity epub 下載 mobi 下載 pdf 下載 txt 電子書 下載 2024

Automata, Computability and Complexity epub 下載 mobi 下載 pdf 下載 txt 電子書 下載 2024

Automata, Computability and Complexity pdf epub mobi txt 電子書 下載 2024



圖書描述

The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology. The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework.

Automata, Computability and Complexity 下載 mobi epub pdf txt 電子書

著者簡介


圖書目錄


Automata, Computability and Complexity pdf epub mobi txt 電子書 下載
想要找書就要到 小哈圖書下載中心
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

用戶評價

評分

其實作者寫作風格比較平易近人,不會寫一些很高深但讓人看不懂的句子。我找到BNF的介紹瞭,作者真的蠻用心瞭。美中不足的是文章深度不夠,減一星。

評分

求這本書電子版。

評分

求這本書電子版。

評分

求這本書電子版。

評分

求這本書電子版。

讀後感

評分

評分

評分

評分

評分

類似圖書 點擊查看全場最低價

Automata, Computability and Complexity pdf epub mobi txt 電子書 下載 2024


分享鏈接





相關圖書




本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

友情鏈接

© 2024 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有