Computation Engineering: Applied Automata Theory and Logic (Hardocver)
暫譯: 計算工程:應用自動機理論與邏輯(精裝版)
Ganesh Gopalakrishnan
- 出版商: Springer
- 出版日期: 2006-06-02
- 售價: $1,300
- 貴賓價: 9.8 折 $1,274
- 語言: 英文
- 頁數: 472
- 裝訂: Hardcover
- ISBN: 0387244182
- ISBN-13: 9780387244181
下單後立即進貨 (約5~7天)
買這商品的人也買了...
-
$1,810$1,720 -
$2,220$2,109 -
$620$527 -
$1,400$1,330 -
$1,430$1,359 -
$780$741 -
$680$537 -
$560$437 -
$480$336 -
$420$332 -
$680$530 -
$600$474 -
$450$351 -
$620$490 -
$880$695 -
$500$390 -
$500$395 -
$580$458 -
$400$316 -
$560$437 -
$680$530 -
$630$498 -
$680$537 -
$800$632 -
$750$593
商品描述
Description
Although it is critical in today’s world that students who take automata theory and logic courses retain what they have learned and understand how to use their knowledge, many textbooks typically emphasize automata theory only, not logic, thus losing a valuable opportunity to tie these subjects together and reinforce learning. This textbook uses interactive tools throughout, such as simple BDD and SAT tools. By providing a blend of theory and practical applications the material is presented as both inviting and current. Key concepts are illustrated in multiple domains so that information is reinforced and students can begin to tie theory and logic together.
Table of Contents
Foreword.- Introduction.- Mathematical Preliminaries.- Cardinalities and Diagonalization.- Binary Relations.- Mathematical Logic, Induction, Proofs.- Dealing with Recursion.- Strings and Languages.- Machines, Languages, DFA.- NFA and Regular Expressions.- Operations on Regular Machinery.- The Automaton/Logic Connection, Symbolic Techniques.- The `Pumping' Lemma.- Context-free Languages.- Push-down Automata and Context-free Grammars.- Turing Machines.- Basic Undecidability Proofs.- Advanced Undecidability Proofs.- Basic Notions in Logic including SAT.- Complexity Theory and NP-Completeness.- DFA for Presburger Arithmetic.- Model Checking: Basics.- Model Checking: Temporal Logics.- Model Checking: Algorithms.- Conclusions.
商品描述(中文翻譯)
**描述**
雖然在當今世界中,學習自動機理論和邏輯課程的學生保留所學知識並理解如何使用這些知識是至關重要的,但許多教科書通常僅強調自動機理論,而不涉及邏輯,從而失去了將這些主題結合起來並加強學習的寶貴機會。本教科書在整個過程中使用互動工具,例如簡單的 BDD 和 SAT 工具。通過提供理論與實際應用的結合,材料的呈現既吸引人又符合當前趨勢。關鍵概念在多個領域中進行說明,以便加強信息,並使學生能夠開始將理論和邏輯結合起來。
**目錄**
前言.- 介紹.- 數學初步.- 基數與對角化.- 二元關係.- 數學邏輯、歸納法、證明.- 處理遞歸.- 字串與語言.- 機器、語言、DFA.- NFA 和正則表達式.- 正則機器的操作.- 自動機/邏輯連結,符號技術.- “抽水”引理.- 上下文無關語言.- 推進自動機和上下文無關文法.- 圖靈機.- 基本不可判定性證明.- 進階不可判定性證明.- 邏輯中的基本概念,包括 SAT.- 複雜性理論與 NP 完全性.- Presburger 算術的 DFA.- 模型檢查:基礎.- 模型檢查:時間邏輯.- 模型檢查:算法.- 結論。