CSC 430 : THEORY OF COMPUTATION

Introduction to automata theory, formal languages, and complexity. Introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity. Quantitative GEP requirement.
Minor, Elective credit.

Prerequisites

CSC 202 and MTH 205.

Overview

Program

Credits

3