Tentative Course Schedule
CS315 --- Automata Theory
Weeks
Topic(s)
Readings
1-2
Math.
Preliminaries and Languages
Ch.
1 & 2
3-5
Finite
Automata; Regular languages and Sets
Ch.
5& 6
Exam 1 (exact material and date TBD depending on lecture progress)
6-8
Context-free
grammars; Normal forms
Ch.
3 & 4
9-11
Pushdown
automata and CFL
Ch.
7
Exam 2 (exact material and date TBD depending on lecture progress)
12-14
Turing
machines
Ch.
8
15
Chomsky
hierarchy (time permitting)
Ch.
10
Vital Notes:
I expect you to have read the entire chapter listed for a given
week before the first lecture of
that week. That way, you have already had an opportunity to review the
material before it appears in lecture; this will give you a MUCH
greater chance of understanding and integrating the material when we
cover it. Quizzes may be used to encourage you to keep up on the reading.
Syllabus
Schedule 
