Id: 008077 Credits Min: 3 Credits Max: 3

Description

A survey of the mathematical foundations of Computer Science. Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable sets. Decidability. Complexity. This course involves no computer programming.

Prerequisites

Pre-Req: COMP 1020 Computing II, and MATH 3220 Discrete Structures II.

View Current Offerings