CMSC 452: Elementary Theory of Computation

Spring 2017 HOMEPAGE

The Syllabus is in two parts:

• Content of Course:
• Policy for the course:

HOMEWORKS

HW01 (Morally Due Feb 7)

HW01 MAKEUP

HW01SOL

HW02 (Morally Due Feb 14)

HW02SOL

HW03 (Morally Due Feb 21)

PROJECT ONE (Morally Due Mar 14)

HW04 (Morally Due Feb 28)

HW04SOL (Morally Due Feb 28)

HW05 (Morally Due Mar 7)

HW05SOL (Morally Due Mar 7)

HW06 (Morally Due Mar 14)

HW06SOL

HW07 (DUE DUE Mar 28)

HW07SOL

HW08 (Morally DUE Apr 11)

HW08SOL

PROJ TO AVOID A D (DUE the day of Final)

MIDTERM

MIDTERM SOLUTION

PROJECT TWO (Morally Due April 25)

HW09 (Morally DUE Apr 18)

HW09SOL

HW10 (Morally DUE Apr 25)

HW10SOL

HW11 (Morally DUE May 2)

HW11SOL

HW12 (Morally DUE May 9)

HW12SOL

Notes

roots ($2^{1/4}$ not a root of a cubic over Z.)

clever (Clever proofs of closure of DFA's under concat and *.)

Rijk (Notes on the R(i,j,k) algorithm)

Closure (Summary of Closure Properties and some proofs)

WS1S decidable-Notes

WS1S decidable-Talk

WS1S and WS2S Packages

Comm Complexity Talk

Comm Complexity Notes

Aaron George PL

Small NFA for ...

Turing Machines, Time and Space Classes

NP

HALT as done by...