CS341 Automata Theory
Elaine Rich
Schedule of Classes – Spring, 2014
Week 
Topics 

Jan. 14 
Why study
automata theory 


Review of
background topics 

Jan. 21 
What is a
language? 

The big
picture 


Finite
state machines 


Jan. 28 
Nondeterministic
finite state machines 

Finite
state transducers 


Stochastic
FSMs 


Feb. 4 
Regular
expressions 

Equivalence
of regular expressions and FSMs 


Closure
properties of regular languages 


Feb. 11 
Regular
Pumping Theorem 

Functions
on regular languages 


Feb.18 
Decision
procedures for regular languages 

Review of
regular languages 


Contextfree
grammars 


Feb. 25 
Manipulating
contextfree grammars 
Tuesday
evening: Midterm 1 
Parse trees 



Ambiguity 

March 4 
Pushdown
automata 

Equivalence
of PDAs and CFGs 


March 12 
SPRING
BREAK 

March 18 
ContextFree
Pumping Theorem 


Closure
properties of contextfree languages 

March 25 
Decision
procedures for CF languages 

Turing
machines 


April 1 
Multiple
tapes and nondeterminism 
Tuesday
evening: Midterm 2 
Simulating real
computers 


The
Universal Turing machine 


Church’s
Thesis 


April 8 
Other
computational models 

The unsolvability of the halting problem 


Decidable
and semidecidable languages 


April 15 
Reduction
proofs for undecidability 

April 22 
Rice’s
Theorem 

Reduction
proofs for nonsemidecidability 


April 29 
More on
reduction proofs 

Other
undecidable problems 


The Chomsky
Hierarchy 



