CS 321 Theory of Computation (Undergraduate)

School of Electrical Engineering and Computer Science
Oregon State University
Corvallis, OR 97331

Schedule

Overall:
Part I: Finite-State Automata and Regular Language


Part II: Context-Free Languages and Pushdown Automata
Parts III: Turing Machines
FINAL EXAM MONDAY 0930-1120 ON 12/7/15 IN LINC 100. CLOSED BOOK, CLOSED NOTES.
** topics beyond Sipser, but covered in Linz, Hopcroft et al., and Lewis and Papadimitriou.
Back to Course Homepage