CMSC 452 Slides and Recordings. Dates for the future are guesswork

Jan 26: Admin, Intro to Theory of Computation SLIDES IN PROGRESS

Deterministic Finite Automata SLIDES IN PROGRESS

Deterministic Finite Automata-arithmetic tricks SLIDES IN PROGRESS

Deterministic Finite Automata-Closure Prop SLIDES IN PROGRESS

NonDeterministic Finite Automata SLIDES IN PROGRESS

NonDeterministic Finite Automata-Closure Prop SLIDES IN PROGRESS

Regular Expressions SLIDES IN PROGRESS

Regular Expressions Closure Prop SLIDES IN PROGRESS

Proving Languages are NOT Reg SLIDES IN PROGRESS

A lang that needs a large NFA SLIDES IN PROGRESS

Context Free Languages SLIDES IN PROGRESS

Comparing DFA to NFA to CFG SLIDES IN PROGRESS

TMs, DTIME SLIDES IN PROGRESS

Concrete Time H Thm SLIDES IN PROGRESS

P, NP, Reductions. SLIDES IN PROGRESS

Cook-Levin Thm SLIDES IN PROGRESS

NPC Probs SLIDES IN PROGRESS

Closure Properties for P and NP SLIDES IN PROGRESS

SAT Solvers SLIDES IN PROGRESS

CLIQ to SAT SLIDES IN PROGRESS

Decidability and Undecidability SLIDES IN PROGRESS MORE SLIDES

WS1S SLIDES IN PROGRESS

Final Review SLIDES IN PROGRESS