Theory of Computation
A study of the basic theoretical principlesyembodied in formal languages and automata. Topicsyinclude finite automata, context-free grammars,yTuring machines, computability, and the haltingyproblem. Upon completion of this course, theystudent will be able to apply theoretical modelsyto the solution of computational problems.yPrerequisite: Information Science and Technologyy145, Mathematics 250. Offered alternate springyterms.