Prerequisites: MATH 200, senior standing. Offered in fall and spring.
Finite automata and regular expressions, context-free grammars and push-down automata, nondeterminism. Context-sensitive grammars and the Chomsky heirarchy of grammars. Turing machine and the halting problem.Undecidable problems. Church's Conjecture and its implications.
