CMSC 452 Notes

PICTURE: DFA for Sigma* a Sigma Sigma

NOTES: Closure Properties for Reg Langs

R(i,j,k) Method for converting DFA to REGEX

Example of R(i,j,k) Method for converting DFA to REGEX

NOTES: If L is a CFL then L is in P

CFG Stuff

Turing Machines

Time Classes

NP

Closure properties of P and NP

The Cook-Levin Theorem

Reductions Using SAT

Algorithms for SAT

Karp's Turing Award Speech

Primitive Recursive Functions

Decidability

Decidability of WS1S

Bounded Queries in Computability Theory

Kolmogorov Complexity