|
Topics
|
Lecture Download |
|
Introduction and Overview
|
ppt, readme
|
|
Generalized Computers, Strings, Languages.
Finite Automata (FA's)
|
ppt, readme
|
|
Regular Languages and Regular Operations;
emacs regular expressions
|
ppt, readme
|
|
Closure of Regular Languages Under Boolean
Operations.
|
ppt
|
|
Nondeterminstics FA's (NFA's). Regular
Expressions (REG); FA = NFA = REG
|
ppt
|
|
Minimization. Pumping Lemma
|
ppt
|
|
Context Free Languages: Derivations,
Parse-Trees, Ambiguity
|
ppt, Java CFG
|
|
Pushdown Stack Automata (PDA's)
|
ppt
|
|
Grammar and Machine Transformations
|
ppt, readme
|
|
Context Free Pumping Lemma
|
ppt
|
|
Turing Machines: Motivation, Definitions,
Recognizers vs. Deciders
|
ppt, readme
|
|
Turing Machine Variants: 3 levels of TM
abstraction, Non-deterministic recognizers
and deciders, König's infinity lemma,
Multitape TM's
|
ppt
|
|
Universal Models of Computation: TM =
k-track TM = k-tape TM = NTM,
FIFO Queue Machines
|
ppt
|
|
Viewing algorithms as languages, Algorithmic
Decision Problems: ATM,
ACFG , A
REX, ETM, etc.
|
ppt
|
|
Incomputable Languages: Existence of
Incomputable Languages; Cantor's
Diagonalization Argument; Undecidability of
ATM, E
TM, EQTM;
ALLTM
|
ppt
|
|
More Undecidable Problems: Reducibility:
Turing reducible, Mapping reducible,
Co-mapping reducible; Beyond undecidable;
General grammars; Semi-Thue systems (STP);
Post's correspondence problem (PCP);
Problems involving CFG's
|
ppt
|
|
Complexity: Running time, Big-O
review, the class PP and CYK algorithm
|
ppt
|
|
The Class NP: Nondeterministic complexity:
poly-time NTM's, poly-time Verifiers,
poly-size proofs; Punch-Card Puzzle, SAT and
variants, The class Co-NP; Polynomial time
reductions
|
ppt
|
|
NP-complete problems; P vs. NP Open Problem:
Known and unknown hierarchies;
Nondeterministic complexity
|
ppt
|
|
The Cook-Levin Theorem: Showing that CSAT is
NP-hard, Reducing CSAT to 3SAT
|
ppt
|
|
Review
|
ppt
|
