CS 3240 - Introduction to the Theory of Computation

Credits: 2 (2 + 0)

Prerequisite(s): CS 2050 and MTH 3170 with grades of “C” or better, or permission of instructor

This course explores language theory and computability. Language theory includes: regular expressions, regular languages, and finite automata (deterministic and nondeterministic); context-free languages and pushdown automata; and language grammars. Computability includes: Tuning machines and their computing power; unsolvable problems; and intractable problems (NP-Completeness).