IST 315 - Theory of Computation (3)

A study of the basic theoretical principles embodied in formal languages and automata. Topics include finite automata, context-free grammars, Turing machines, computability, and the halting problem. Upon completion of this course, the student will be able to apply theoretical models to the solution of computational problems.

Prerequisite: IST 145 , MTH 250 .
Offered odd spring terms.

Print-Friendly Page (opens a new window)
Close Window