Theory of Computation
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: Information Science and Technology 145, Mathematics 250. Offered alternate spring terms.