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,770$1,682 -
$2,170$2,062 -
$620$527 -
$1,330Pragmatic Thinking and Learning : Refactor Your Wetware (Paperback)
-
$1,270$1,207 -
$770$732 -
$680$537 -
$560$437 -
$480$360 -
$420$332 -
$680$530 -
$600$474 -
$450$351 -
$620$490 -
$880$695 -
$500$390 -
$500$375 -
$580$493 -
$400$316 -
$560$437 -
$680$530 -
$630$498 -
$680$537 -
$800$600 -
$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- 模型檢查:基礎知識- 模型檢查:時間邏輯- 模型檢查:算法- 結論。