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
PDF Reader.
Notes by Lecture Schedule
 1:
Introduction. DFAs and NFAs.
 2:
Regular Expressions and Regular Languages.

3:
ContextFree Languages.

4:
CFLs and PushDown Autamata.

5:
Decision Problems for CFLs.

6:
Turing Machines.

7:
Decidability.

8:
Time complexity. P and NP.
NPcompleteness.

9:
NPcompleteness, continued. Polynomialtime reductions.

10:
Space complexity.
Michael T. Goodrich
Department of Computer Science
University of California, Irvine, CA 926973435 USA