CSC339-Theory of Computation-(3-0-1)

The course introduces the foundations of automata, computability, and complexity theories. It shows the 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 the computational complexity of problems.