CSC 339: Theory of Computation

The course introduces the foundations of automata theory, computability theory, and complexity theory. It shows relationship between automata and formal languages. Addresses the issue of which problems can be solved by computational means (decidability vs undecidability), and introduces concepts related to computational complexity of problems.