Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
C S 415 - THEORY OF COMPUTING |
Formal grammars and languages, Chomsky Normal Form, Greibach Normal Form, finite automata, pushdown automata, turing machines, computability. Prerequisite(s): CS 250 and CS 311.
|