MAT275 Theoretical Aspects of Computer Science
3-3-0

The course will include several of the following topics: Computational models; Computational complexity; Finite-state machines; Context-free languages; Pushdown automata; Turing machines; Undecidable problems.

Prerequisite: Math 105


See Computer Science 305b
Students may not take this course for credit if they have received credit for Computer Science 305b