Select the desired Level or 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.
Prerequisites: (Undergraduate Level level C S 250 Minimum Grade of D and Undergraduate Level level C S 311 Minimum Grade of D) |
Return to Previous | New Search |