COS3701 - Theoretical Computer Science III

This module covers the theory of computability, including context-free languages, recursively enumerable languages, and the machines that accept them. Students will explore the Chomsky hierarchy, pushdown automata, and Turing machines.