What you will learn

• Master finite automata, pushdown automata, and Turing machines to analyse computation limits and formal language processing.

• Understand computability, NP-completeness, and complexity classes to assess problem-solving limits in theoretical computer science.

• Apply proof techniques and logic to formalise computational models, algorithmic efficiency, and automata-based problem-solving.

• Construct regular expressions and context-free grammars to solve pattern matching and parsing problems in software engineering.