CS 35103 - Theory of Computation

This course introduces students to the concepts of languages, automata, computability theory, and complexity theory. Topics covered include regular languages, context-free languages, Turing machines, and parsing.

Offered: On Demand

Semester Hours: 3
Prerequisite(s): CS 22003 and MTH 25403.