CS 3240 - Introduction to the Theory of Computation

2(2 + 0)

Prerequisite: CS 3050 and MTH 3100 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).