Computer Language Theory
Computer Language Theory
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.
2024SPRGMETCS662 A1, Jan 22nd to Apr 29th 2024
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | FLR |
2024SPRGMETCS662 A2, Jan 24th to May 1st 2024
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| W | 06:00 PM | 08:45 PM | FLR |
2023FALLMETCS662 A1, Sep 5th to Dec 12th 2023
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| T | 06:00 PM | 08:45 PM | CDS | 263 |
2023FALLMETCS662 A2, Sep 7th to Dec 7th 2023
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| R | 06:00 PM | 08:45 PM | CAS | 201 |
Restrictions: Not for CS Majors