Lecture notes

Lecture Notes (11): NP-completness.

Lecture Notes (10): Reducibility.

Lecture Notes (9): Decidability.

Lecture Notes (8): Turing machines.

Lecture Notes (7): Non-context-free languages.

Lecture Notes (6): Pushdown automata.

Lecture Notes (5): Context-free grammars.

Lecture Notes (4): Non-regular languages.

Lecture Notes (3): Regular expressions.

Lecture Notes (2): Deterministic and nondeterministic finite automata.

Lecture Notes (1): Forms of theorems, proof techniques, and introduction to Theory of Compuatation.