CSC 520 : Theory of Computing
| Prerequisites: | CSC 213, MATH 325, and MATH 330 or CSC 330 with grades of C or better. |
| Description: | Automata, formal languages, and the notion of computability. Sequential machines as language acceptors. Context free and context sensitive grammars. Computable and recursive functions, universal turing machines. Unsolvable problems. |
| Units: | 3 |
| Effective: | Fall 1994 |
| Latest Offering: | Fall 2009 |
