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.
2026FALLMETCS662A1, Sep 2nd to Dec 10th 2026
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| T | 06:00 PM | 08:45 PM | CGS | 521 |
2026FALLMETCS662A2, Sep 2nd to Dec 10th 2026
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| R | 06:00 PM | 08:45 PM | CAS | 204A |
2027SPRGMETCS662A1, Jan 19th to Apr 29th 2027
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | PHO | 201 |
2027SPRGMETCS662A2, Jan 19th to Apr 29th 2027
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| W | 06:00 PM | 08:45 PM | CAS | 218 |
Restrictions: Not for CS Majors