CS 310 - Theoretical Computer Science

4 credit(s)
This course introduces the foundations of formal language theory, computability, and complexity, shows the relationship between automata and various classes of languages, addresses the issue of which problems can be solved by computational means and studies the complexity of their solutions. It also studies Turing machines and equivalent models of computation, the Chomsky hierarchy, context free grammars, push-down automata, and computability.
Offered: Alternate years.

Prerequisite(s): CS 250 with a minimum C grade.