Myhill-Nerode Theorem Note

This describes how to use myhill-nerodes theorem to prove that languages are not regular.

Intractable and NP-complete Problems

This is some papers and notes I wrote for my theory of computer science class to teach them about computational complexity, computability and intractable problems.