Catalog Entries |
Spring Term 2011
Apr 28, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CS 350 - 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: Undergraduate Schedule Types: Lecture Computer and Information Sci Department Course Attributes: Tuition Arts and Sciences |
|