Jan 26: Admin, Intro to Theory of Computation SLIDES

Jan 28 Deterministic Finite Automata SLIDES

Feb 2 Deterministic Finite Automata-arithmetic tricks SLIDES

Feb 4 Deterministic Finite Automata-Closure Prop SLIDES

Feb 4(some) NonDeterministic Finite Automata SLIDES

Feb 9 NonDet. Finite Automata:Closure Prop SLIDES

Feb 11 Regular Expressions SLIDES

Feb 11 Regex Closure Props DID NOT GIVE THIS LECTURE- READ IF INTERESTED SLIDES

Feb 16 Number of States SLIDES

Paper on Small NFAs PAPER

Feb 23 Proving Languages are NOT Reg SLIDES

Feb 25,Mar 02 Context Free Languages SLIDES

Is a program in the write syntax is Undecidable?DISCUSSION

Mar 4 CFL in P SLIDES DFA-NFA-CFL SLIDES

Mar 9 Context Senstive Grammars SLIDES

Mar 11 Midterm Review

Mar 25 SLIDES DTIME, P, EXP, NP SLIDES

Mar 30 More on NPC SLIDES

Apr 1 Cook Levin Theorem SLIDES

Apr 8 CLIQ TO SAT SLIDES

Apr 13 TSP hard to approx SLIDES

Apr 15 Closure Properties SLIDES FACTORING prob not NPC SLIDES REC

(NOT COVERED) SAT SOLVERS SLIDES

(NOT COVERED) Hard Cases for SAT SOLVERS. SLIDES

Apr 20 Decidability and Undecidability SLIDES DR. SUESS HALTING PROBLEM

Apr 22 WS1S SLIDES

Apr 27 WS1S SLIDES

Apr 27 Examples of WS1S Atomic Formulas DFA SLIDES

Apr 29 WS1S SLIDES

May 4 Kolm Comp SLIDES

May 6 Other Toics SLIDES

Misc stuff that was NOT in our course

TALK TO APPLIED MATH GRAD STUDENTS ON P VS NP

FUN WITH HARDNESS GUEST LECTURES (CMSC 858

Crytalgorihtm SLIDES IN PROGRESS

NPGRID SLIDES IN PROGRESS