CMSC 452 Slides. Dates for the future are guesswork
INTRO AND REGULAR LANGS
Jan 28:
Admin, Intro to Theory of Comp
Jan 28
DFAs
Jan 30
DFAs for Arithmetic Tricks
Jan 30
DFA Closure
Feb 4
NFAs
Feb 4
NFA Closure
Feb 6
Number of States
Feb 6
Small NFAs
Feb 11
Reg Expressions (regex)
Feb 11
HW02 solutions
Feb 13-18
regex closure
Feb 18
Recording From Feb 18
Feb 18-20
Proving Langs Not Reg
Feb 25
The 3-4-5 problem
Feb 25,27
CFL's
Feb 27
HW03 sol
Feb 27
HW04 sol
March 4
CFG's For Finite Unary Languages
Syn Correct C
Programs Undecdable?
March 6
HW05 sol
March 11
CFL in P
March 13
Context Sensitive Languages
OLD MIDTERM
GUIDELINES FOR MIDTERM
March 25
Mid Review Reg
,
Mid Review CFL
March 27
hw06sol
,
hw07sol
April 1 Midterm1
April 3
Midterm Solutions
P, NP, ETC.
April 3,8
DTIME, P, EXP, NP SLIDES
April 8
More on NPC
April 15,17
Cook-Levin Thm
April 17
hw10 Solutions
April 22
Closure Properties of P and NP
April 22
Functions and Sets
April 24
Is Factoring NPC?
April 24
CLIQ TO SAT
April 24
Hw9 Solutions
OPTIONAL
Is Graph Isomorphism NPC?
OPTIONAL
SAT Variants and Cryarithms
OPTIONAL
SAT SOLVERS
DECIDABLE & UNDECIDABLE SETS
April 29
Decidable and Undecidable
April 29?
More on Hilbert's 10th Problem
Alternative Proof that HALT is undec
]
S1S Decidable
S2S Decidable
Link to the MONA website-dec of WS2S