CS 461 - Theory of Computation

This course provides an introduction to basic models of computational complexity and the representation of infinite objects. Topics that will be examined including grammars, finite state machines, automata theory, Turing machines, computability and decidability, regular and context free languages.

Requisites: CS 316 (Required, Previous).

Credits:4 cr

Session Cycle: Fall onlyYearly Cycle: Every Year