CS341 Automata Theory
Elaine Rich
Schedule of Classes – Spring, 2013
|
Week |
Topics |
|
|
Jan. 15 |
Why study
automata theory |
|
|
|
Review of
background topics |
|
|
Jan. 22 |
What is a
language? |
|
|
The big
picture |
|
|
|
Finite
state machines |
|
|
|
Jan. 29 |
Nondeterministic
finite state machines |
|
|
Finite
state transducers |
|
|
|
Stochastic
FSMs |
|
|
|
Feb. 5 |
Regular
expressions |
|
|
Equivalence
of regular expressions and FSMs |
|
|
|
Closure
properties of regular languages |
|
|
|
Feb. 12 |
Regular
Pumping Theorem |
|
|
Functions
on regular languages |
|
|
|
Feb.19 |
Decision
procedures for regular languages |
|
|
Review of
regular languages |
|
|
|
Context-free
grammars |
|
|
|
Feb. 26 |
Manipulating
context-free grammars |
Tuesday
evening: Midterm 1 |
|
Parse trees |
|
|
|
|
Ambiguity |
|
|
March 5 |
Pushdown
automata |
|
|
Equivalence
of PDAs and CFGs |
|
|
|
March 12 |
SPRING
BREAK |
|
|
March 19 |
Context-Free
Pumping Theorem |
|
|
|
Closure
properties of context-free languages |
|
|
March 26 |
Decision
procedures for CF languages |
|
|
Turing
machines |
|
|
|
April 2 |
Multiple
tapes and nondeterminism |
Tuesday
evening: Midterm 2 |
|
Simulating real
computers |
|
|
|
The
Universal Turing machine |
|
|
|
Church’s
Thesis |
|
|
|
April 9 |
Other
computational models |
|
|
The unsolvability of the halting problem |
|
|
|
Decidable
and semidecidable languages |
|
|
|
April 16 |
Reduction
proofs for undecidability |
|
|
April 23 |
Rice’s
Theorem |
|
|
Reduction
proofs for nonsemidecidability |
|
|
|
April 30 |
More on
reduction proofs |
|
|
Other undecidable problems |
|
|
|
The Chomsky
Hierarchy |
|
|
|
|
|