HOME > 상세정보

상세정보

Computation engineering : applied automata theory and logic

Computation engineering : applied automata theory and logic (3회 대출)

자료유형
단행본
개인저자
Gopalakrishnan, Ganesh.
서명 / 저자사항
Computation engineering : applied automata theory and logic / Ganesh Gopalakrishnan.
발행사항
New York, NY :   Springer ,   c2006.  
형태사항
xxxv, 471 p. : ill. ; 25 cm.
ISBN
9780387244181 0387244182 0387325204 (e-isbn)
서지주기
Includes bibliographical references (p. [453]-460) and index.
일반주제명
Computer science -- Mathematics. Computer logic. Machine theory.
000 01013camuu22003137a 4500
001 000045395822
005 20071101152102
008 071101s2006 nyua b 001 0 eng d
010 ▼a 2006920602
020 ▼a 9780387244181
020 ▼a 0387244182
020 ▼a 0387325204 (e-isbn)
035 ▼a (KERIS)REF000013042644
040 ▼a OHX ▼c OHX ▼d TXH ▼d DLC ▼d 211009
042 ▼a lccopycat
050 0 0 ▼a QA76.9.M35 ▼b G67 2006
072 7 ▼a QA ▼2 lcco
082 0 0 ▼a 004.01/51 ▼2 22
090 ▼a 004.0151 ▼b G659c
100 1 ▼a Gopalakrishnan, Ganesh.
245 1 0 ▼a Computation engineering : ▼b applied automata theory and logic / ▼c Ganesh Gopalakrishnan.
260 ▼a New York, NY : ▼b Springer , ▼c c2006.
300 ▼a xxxv, 471 p. : ▼b ill. ; ▼c 25 cm.
504 ▼a Includes bibliographical references (p. [453]-460) and index.
650 0 ▼a Computer science ▼x Mathematics.
650 0 ▼a Computer logic.
650 0 ▼a Machine theory.
945 ▼a KINS

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 004.0151 G659c 등록번호 121158508 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차

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.


정보제공 : Aladin

관련분야 신착자료

김자미 (2021)