Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
CS 650 - Automata/Langs/Computation |
Formal grammars and automata, Turing machines, computability and decidability, computational complexity, intractability.
3.000 Credit hours Levels: Graduate Non-Degree, Graduate Schedule Types: Lecture Computer and Information Sci Department Course Attributes: Tuition Arts and Sciences |