CS 4410, Fall 2016 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
WK 
Class/Date 
Topic 
Book Chapter 
Assignments

Reading 
W 8/24 
Syllabus 
1 

Syllabus 

F 8/26 
Mathematical Preliminaries 
1.1 
HW 1
Assigned 
Chapter 1 

2 
M
8/29 
Mathematical Preliminaries  1.1 

W 8/31 
Mathematical Preliminaries  1.1 
HW1 Due 

F 9/2 
Go over HW 1 
1.1 

3 
M 9/5 
Labor Day
Holiday 

W 9/7 
Mathematical Preliminaries  1.1 
HW2 Assigned 

F 9/9 
Three Basic Concepts 
1.2 

4 
M 9/12 
Three Basic Concepts  1.2 
Chapter 2 

W 9/14 
DFAs 
2.1 
HW2
Due 

F 9/16 
Go Over Homework 2 

5 
M 9/19 
DFAs 
2.1 
HW3 Assigned  
W 9/21 
NFAs 
2.2 

F
9/23 
NFA > DFA 
2.3 
HW3 Due  
6 
M
9/26 
Go Over Homework 3 
HW4 Assigned  Chapter 3 

W 9/29 
Regular Expressions and
Regular Languages 
3.1 
HW5 Assigned  
F
9/30 
Regular Expressions and Regular Languages  3.2 
HW4 Due  
7 
M 10/3 
Homework 4 
Chapter 4 

W 10/5 
Regular Expressions and Regular Languages  3.2 

F 10/7 
The P
versus NP Problem by Scott Aaronson 
Reaction Paper: What is P vs NP? Why is it important? 
You
Tube Link 

8 
M 10/10 
Regular Grammars  3.3 

W 10/12 
NonInstructional
Day: No Class 

F 10/14 
Regular Grammars 
3.3 
HW5 Due HW6 Assigned 

9 
M 10/17 
Go over homework 5 

W 10/19 
Homework 5 and
finish 3.3 
3.3 

F 10/21 
Properties of Regular Languages  4.1 

10 
M 10/24 
Elementary Questions About Regular
Languages 
4.2 

W 10/26 
Identifying
Nonregular Languages 
4.3 

F 10/28 
Identifying Nonregular Languages  4.3 

11 
M 10/31 
Go over HW 6 
HW6 Due 

W 11/2 
Tech Fair 

F 11/4 
Identifying Nonregular Languages  4.3 



ContextFree Grammars 
5.1 
HW7 Assigned 
Chapter 5 
W 11/9 
ContextFree Grammars  5.1 

F 11/11 
School Holiday: Veterans' Day  
13 

Parsing and Ambiguity  5.2 

W 11/16 
Parsing and Ambiguity  5.2 

F 11/18 
ContextFree Grammars and Programming Languages  5.3 

14 

ContextFree Grammars and Programming Languages  5.3 

W 11/23 
Turn in HW 7 
HW7 Due  
F 11/25 
School Holiday: Thanksgiving  
15 

NPDAs and Greibach Normal
Form 
7.1, 6.2 

W 11/30 
NPDAs 
7.1 

F 12/2 
PDAs and CFLs Deterministic PDAs and Deterministic CFLs 
7..2, 7.3 

16 

Pumping Lemma for CFLs Closure Properties for CFLs 
8.1, 8.2 
HW8 Assigned  
W 12/7 
Turing
Machines 
9.1 

F 12/9 
Some problems that cannot be
solve by Turing Machines 
12.1 

17 
M 12/12 
Efficiency of Computation 
14.1 

T 12/13 
Reading Day  

Wednesday 12/14 
FINAL EXAM 
HW8 Due 