Introduction to the Theory of Computation
副标题：无
分类号：
ISBN：9787111108405
微信扫一扫,移动浏览光盘
简介
This book——by a noted authority and educator in the field——presents computer
science theory from a uniquely intuitive,“big picture”perspective.The author grounds his clear and interesting study on broad mathematical princi-ples,not low-level technical details:proofs are presented with a “proof idea”component that re-
veals the concetp underlying the mathematical formalism.Similarly,algorithms are pr-esented using prose rather than pseudocode to focus attention on the algorithms the-
mselves,rather than on specific models.Formerly published in a Preliminary Edition,
this First Edition features additional chapters on space complexity (Chapter 8),pro-vable intractability (Chapter 9)and advanced topics in computability theory(Chapter
10).For further information,see the World Wide Web site for the book at:
math.mit.edu/sipser/book.html
目录
preface
to the student
to the educator
the current edition
feedback to the author
acknowledgments
0 introduction
0. l automata, computability, and complexity
complexity theory
computability theory
automata theory
0.2 mathematical notions and terminology
sets
sequences and tuples
functions and relations
graphs
strings and languages
boolean logic
summary of mathematical terms
.o.3 definitions, theorems, and proofs
finding proofs
0.4 types of proof
proof by construction
proof by contradiction
proof by induction
exercises and problems
part one: automata and
l regular
l . l finite automata
formal definition of a finite automaton
examples of finite automata
formal definition of computation
designing finite automata
the regular operations
l .2 nondeterminism
formal definition of a nondeterministic finite automaton
equivalence of nfas and dfas
closure under the regular operations
l . 3 regular expressions
formal definition of a regular expression
equivalence with finite automata
l .4 nonregular languages
the pumping lemma for regular languages
exercises and problems
2 context-free languages
2 . l context-free grammars
formal definition of a context-free grammar
examples of context-free grammars
designing context-free grammars
ambiguity
chomsky normal form
2 .2 pushdown automata
formal definition of a pushdown automaton
examples of pushdown automata
equivalence with context-free grammars
2 . 3 non-context-free languages
the pumping lemma for context-free languages
exercises and problems
part two: computability theory
3 the church-turing thesis
3 . l turing machines
formal definition of a turing machine
examples of turing machines
3 .2 variants of turing machines
multitape turing machines
nondeterministic turing machines
enumerators
equivalence with other models
3 .3 the definition of algorithm
hilbert's problems
terminology for describing turing machines
exercises and problems
4 decidability
4. l decidable languages
decidable problems concerning regular languages
decidable problems concerning context-free languages
4.2 the halting problem
the diagonalization method
the halting problem is undecidable
a turing-unrecognizable language
exercises and problems
5 reducibility
5 . l undecidable problems from language theory
reductions via computation histories
5.2 a simple undecidable problem
5 . 3 mapping reducibility
computable functions
formal definition of mapping reducibility
exercises and problems
6 advanced topics in computability theory
6. 1 the recursion theorem
self-reference
terminology for the recursion theorem
applications
6.2 decidability of logical theories
a decidable theory
an undecidable theory
6. 3 turing reducibility
6.4 a definition of information
minimal length descriptions
optimality of the definition
incompressible strings and randomness
exercises and problems
part three: complexity theory
7 time complexity
7. l measuring complexity
big-o and small-o notation
analyzing algorithms
complexity relationships among models
7.2 the class p
polynomial time
examples of problems in p
7.3 the class np
examples of problems in np
the p versus np question
7 .4 np-completeness
polynomial time reducibility
definition of np-completeness
the cook-levin theorem
7. 5 additional np-complete problems
the vertex cover problem
the hamiltonian path problem
the subset sum problem
exercises and problems
8 space complexity
8. l savitch's theorem
8.2 the class pspace
8 . 3 pspace-completeness
the tqbf problem
winning strategies for games
generalized geography
8.4 the classes land nl
8. 5 nl-completeness
searching in graphs
8.6 nl equals conl
exercises and problems
9 intractability
9. l hierarchy theorems
exponential space completeness
9.2 relativization
limits of the diagonalization method
9. 3 circuit complexity
exercises and problems
10 advanced topics in complexity theory
l0. l approximation algorithms
l0.2 probabilistic algorithms
the class bpp
primality
read-once branching programs
10.3 alternation
alternating time and space
the polynomial time hierarchy
10.4 interactive proof systems
graph nonisomorphism
definition of the model
ip = pspace
l0.5 parallel compuation
uniform boolean circuits
the class nc
p-completeness
io.6 cryptography
secret keys
public-key cryptosystems
one-way functions
trapdoor functions
exercises and problems
selected bibliography
index
to the student
to the educator
the current edition
feedback to the author
acknowledgments
0 introduction
0. l automata, computability, and complexity
complexity theory
computability theory
automata theory
0.2 mathematical notions and terminology
sets
sequences and tuples
functions and relations
graphs
strings and languages
boolean logic
summary of mathematical terms
.o.3 definitions, theorems, and proofs
finding proofs
0.4 types of proof
proof by construction
proof by contradiction
proof by induction
exercises and problems
part one: automata and
l regular
l . l finite automata
formal definition of a finite automaton
examples of finite automata
formal definition of computation
designing finite automata
the regular operations
l .2 nondeterminism
formal definition of a nondeterministic finite automaton
equivalence of nfas and dfas
closure under the regular operations
l . 3 regular expressions
formal definition of a regular expression
equivalence with finite automata
l .4 nonregular languages
the pumping lemma for regular languages
exercises and problems
2 context-free languages
2 . l context-free grammars
formal definition of a context-free grammar
examples of context-free grammars
designing context-free grammars
ambiguity
chomsky normal form
2 .2 pushdown automata
formal definition of a pushdown automaton
examples of pushdown automata
equivalence with context-free grammars
2 . 3 non-context-free languages
the pumping lemma for context-free languages
exercises and problems
part two: computability theory
3 the church-turing thesis
3 . l turing machines
formal definition of a turing machine
examples of turing machines
3 .2 variants of turing machines
multitape turing machines
nondeterministic turing machines
enumerators
equivalence with other models
3 .3 the definition of algorithm
hilbert's problems
terminology for describing turing machines
exercises and problems
4 decidability
4. l decidable languages
decidable problems concerning regular languages
decidable problems concerning context-free languages
4.2 the halting problem
the diagonalization method
the halting problem is undecidable
a turing-unrecognizable language
exercises and problems
5 reducibility
5 . l undecidable problems from language theory
reductions via computation histories
5.2 a simple undecidable problem
5 . 3 mapping reducibility
computable functions
formal definition of mapping reducibility
exercises and problems
6 advanced topics in computability theory
6. 1 the recursion theorem
self-reference
terminology for the recursion theorem
applications
6.2 decidability of logical theories
a decidable theory
an undecidable theory
6. 3 turing reducibility
6.4 a definition of information
minimal length descriptions
optimality of the definition
incompressible strings and randomness
exercises and problems
part three: complexity theory
7 time complexity
7. l measuring complexity
big-o and small-o notation
analyzing algorithms
complexity relationships among models
7.2 the class p
polynomial time
examples of problems in p
7.3 the class np
examples of problems in np
the p versus np question
7 .4 np-completeness
polynomial time reducibility
definition of np-completeness
the cook-levin theorem
7. 5 additional np-complete problems
the vertex cover problem
the hamiltonian path problem
the subset sum problem
exercises and problems
8 space complexity
8. l savitch's theorem
8.2 the class pspace
8 . 3 pspace-completeness
the tqbf problem
winning strategies for games
generalized geography
8.4 the classes land nl
8. 5 nl-completeness
searching in graphs
8.6 nl equals conl
exercises and problems
9 intractability
9. l hierarchy theorems
exponential space completeness
9.2 relativization
limits of the diagonalization method
9. 3 circuit complexity
exercises and problems
10 advanced topics in complexity theory
l0. l approximation algorithms
l0.2 probabilistic algorithms
the class bpp
primality
read-once branching programs
10.3 alternation
alternating time and space
the polynomial time hierarchy
10.4 interactive proof systems
graph nonisomorphism
definition of the model
ip = pspace
l0.5 parallel compuation
uniform boolean circuits
the class nc
p-completeness
io.6 cryptography
secret keys
public-key cryptosystems
one-way functions
trapdoor functions
exercises and problems
selected bibliography
index
Introduction to the Theory of Computation
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ：4006604884
云图客服：
用户发送的提问，这种方式就需要有位在线客服来回答用户的问题，这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×
