Detailed Course Information |
Spring Term 2011
May 12, 2024 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 550 - Automata/Formal Lang Theory |
|
Finite-state automata and regular expressions, context-free grammars and pushdown automata, turing machines, computability and decidability, and complexity classes.
3.000 Credit hours Levels: 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 |
| Return to Previous | New Search |
|