Select the desired Level or Schedule Type to find available classes for the course. |

CSC 612 - Foundations of Computer Sci. |

This course covers finite automata and regular expressions, context-free grammars, pushdown automata, properties of regular and context-free languages, Turing machines, undecidability, computational complexity, Cook-Levin theorem and the polynomial time hierarchy. [3-0, 3 cr.]
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Tutorial Computer Science & Mathematics Division Computer Science Department Restrictions: May not be enrolled in one of the following Programs: Freshman Science Freshman Arts Must be enrolled in one of the following Levels: Graduate May not be enrolled in one of the following Degrees: Executive MBA |

Return to Previous | New Search |