CSCI 361(F) Theory of Computation (Same as Mathematics 361) (Q)
This course introduces formal models of computation including finite state automata, regular languages, context-free grammars, and Turing machines. These models provide a mathematical basis for the study of computability -the study of what problems can be solved and what problems cannot be solved. Applications to compiler design and program verification will also be covered.
Format: lecture. Evaluation will be based on problem sets, a midterm examination, and a final examination.
Prerequisites: Computer Science 256 or both a 300-level Mathematics course and permission of instructor. Enrollment limit: 30 (expected: 20).
Hour: HEERINGA