Course Notes - CS 162 - Formal Languages and Automata Theory
The following documents outline the notes for the course CS 162
Formal Languages and Automata Theory.
Much of this material is taken from notes for Jeffrey Ullman's
course, Introduction to Automata and Complexity Theory, at Stanford University.
Note: Some of the notes are in PDF format.
Viewing these files requires the use of a
Notes by Lecture Schedule
Introduction. DFAs and NFAs.
Regular Expressions and Regular Languages.
CFLs and Push-Down Autamata.
Decision Problems for CFLs.
Time complexity. P and NP.
NP-completeness, continued. Polynomial-time reductions.
Michael T. Goodrich
Department of Computer Science
University of California, Irvine, CA 92697-3435 USA