Computer Language Theory
Computer Language Theory
Undergraduate Prerequisites: (METCS566) or instructor's consent - Theory of finite automata and 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. Prerequisite: MET CS 248 or instructor's consent.
2025SPRGMETCS662A1, Jan 21st to May 1st 2025
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | CAS | 233 |
2025SPRGMETCS662A2, Jan 21st to May 1st 2025
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| W | 06:00 PM | 08:45 PM | KCB | 104 |
2024FALLMETCS662A1, Sep 3rd to Dec 10th 2024
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| T | 06:00 PM | 08:45 PM | CAS | 218 |
2024FALLMETCS662A2, Sep 3rd to Dec 10th 2024
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| R | 06:00 PM | 08:45 PM | CAS | 233 |
Restrictions: Not for CS Majors