CS341H Automata Theory - Honors
Elaine Rich
Schedule of Classes
|
Week |
Topics |
|
|
Jan.
19 |
The
big picture |
|
|
What
is a language? |
|
|
|
Finite
state machines |
|
|
|
Jan.
26 |
Nondeterministic
finite state machines |
|
|
Finite
state transducers |
|
|
|
HMMs
and their applications |
|
|
|
Feb.
2 |
Büchi
automata |
|
|
Regular
expressions |
|
|
|
Equivalence
of regular expressions and FSMs |
|
|
|
Regular
grammars |
|
|
|
Feb.
9 |
Closure
properties of regular languages |
|
|
Regular
Pumping Theorem |
|
|
|
Decision
procedures for regular languages |
|
|
|
Feb.
16 |
Context-free
grammars |
|
|
Parse
trees |
|
|
|
Feb.
23 |
Ambiguity |
Tuesday
evening: Midterm 1 |
|
Pushdown
automata |
|
|
|
Equivalence
of PDAs and CFGs |
|
|
|
Context-Free
Pumping Theorem |
|
|
|
March
2 |
NO
CLASS – attend Cybersecurity talk |
|
|
Context-Free
Pumping Theorem, con’d |
|
|
|
Closure
properties of context-free languages |
|
|
|
March
9 |
Deterministic
context-free languages |
|
|
Parikh’s
Theorem |
|
|
|
Decision
procedures for context-free languages |
|
|
|
Turing
machines |
|
|
|
March
16 |
SPRING
BREAK |
|
|
March
23 |
Multiple
tapes and nondeterminism |
|
|
Simulating
real computers |
|
|
|
The
Universal Turing machine |
|
|
|
Church’s
Thesis |
|
|
|
Other
computational models |
|
|
|
The
unsolvability of the halting problem |
|
|
|
March
30 |
Decidable
and semidecidable languages |
Tuesday
evening: Midterm 2 |
|
Reduction
proofs for undecidability |
|
|
|
April
6 |
Rice’s
Theorem |
|
|
Reduction
proofs for nonsemidecidability |
|
|
|
April
13 |
Other
undecidable problems |
|
|
Context-sensitive
languages |
|
|
|
The
Chomsky hierarchy |
|
|
|
April
20 |
Introduction
to complexity theory |
|
|
Review
of asymptotic dominance |
|
|
|
Measuring
time and space complexity |
|
|
|
P
and NP |
|
|
|
April
27 |
Using
reduction for complexity |
|
|
NP-completeness
and the Cook-Levin Theorem |
|
|
|
Other
NP-complete problems |
|
|
|
May
4 |
Space
complexity |
|
|
Practical
solutions for hard problems |
|