Computer Language Theory
Computer Language Theory
Prerequisites: MET CS 566 or consent of instructor. Theory of finite automata, regular expressions, and properties of regular sets. Context- free grammars, context-free languages, and pushdown automata. Turing machines, undecidability problems, and the Chomsky hierarchy. Introduction to computational complexity theory and the study of NP-complete problems.
2026SPRGMETCS662A1, Jan 20th to Apr 30th 2026
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | COM | 215 |
2026SPRGMETCS662A2, Jan 20th to Apr 30th 2026
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| W | 06:00 PM | 08:45 PM | COM | 215 |
Restrictions: Not for CS Majors