This course is an introduction to the theory of computation that explores the fundamental capabilities and limitations of computers by analyzing abstract mathematical models. It covers formal languages, automata theory (Finite Automata, Pushdown Automata, Turing Machines), and classifies problems based on computability and complexity. Students learn to distinguish between solvable/unsolvable and efficient/hard problems. This also aims to understand which problems can be solved using computational devices and how efficiently those problems can be solved. 

Finite Automata and Formal languages