Detailed Course Information |
Fall Term 2014
May 15, 2024 |
|
 |
||
 | Select the desired Level or 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 Restrictions: Must be enrolled in one of the following Levels: Graduate Prerequisites: Graduate level CS 550 Minimum Grade of B |
| Return to Previous | New Search |
|