CS 460 Theory of Computation (3H:0L:3C)
Prerequisites: MATH 337 or Permission of the Department 
This course covers alternative theoretical models of and their relations to formal grammars and languages. Topics include: finite state machines; regular languages and their limitations; tape automata, pushdown automata; context free languages, normal form grammars; Turing machines, halting problem; unsolvable decision problems.