Search Results

Search Results for "CS 420"

CS 420. Automata Theory. 4 Credits.

Provides a mathematical basis for computability and complexity. Models of computation, formal languages, Turing machines, solvability. Nondeterminism and complexity classes.
Requisites: Prereq: CS 315.