CECS 329 Lectures

1. Nondeterministic Finite Automata
2. Deterministic Finite Automata (Annotated)
3. Deterministic Finite Automata
4. NP Complete Problems (Annotated)
5. NP Complete Problems
6. Introduction to Complexity Theory (Annotated)
7. Introduction to Complexity Theory
8. Mapping Reducibility (Annotated)
9. Mapping Reducibility
10. Logic Problems Both Easy and Hard (updated version of the lecture that is annotated starting on page 5)
11. Logic Problems Both Easy and Hard (Annotated Pages 1-4)
12. Logic Problems Both Easy and Hard