Tentative
Schedule by week
1
Preliminaries,
Basic Concepts
Reading: Chapter 1
2
DFAs
and NFAs
Reading: Chapter 2
3
Regular
Expressions, Regular Grammars
Reading: Chapters 3
4
Closure
Properties of Regular Languages
Reading: Chapters 4, pp. 99-113
5
Pumping
Lemma for Regular Languages
Reading: Chapters 4, pp. 114-124
6
Context-Free
Grammars
Reading: Chapters 5
7
Simplifying
Grammars, CFG and Normal Forms
Reading: Chapters 6
8
Mid
Term Exam
9
Pushdown
Automata
Reading: Chapter 7, pp. 175-195
10
Pushdown
Automata (cont’d)
Reading: Chapter 7, pp. 196-204
11
Closure
Properties of CFL, Pumping Lemma for CFL
Reading: Chapter 8
12
Turing
Machines
Reading: Chapter 9
13
Other
Models of Turing Machines
Reading: Chapter 10
14
A
Hierarchy of Formal Languages and Automata
Reading: Chapter 11
15
Computability
and Decidability
Reading: Chapter 12
Updated: August 22, 2015