|
|
|
Appendix: Personnel & Enrollment
|
Theory of Computing
CSCI
422
(
3
cr)
Prerequisites: MATH 200 and 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 hierarchy of grammars. Turing machine and the halting problem. Undecidable problems. Church's Conjecture and its implications.