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.
2022FALLMETCS662 A1, Sep 6th to Dec 6th 2022
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| T | 06:00 PM | 08:45 PM | SOC | B57 |
2023SPRGMETCS662 A1, Jan 23rd to May 1st 2023
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | CAS | B18 |
2023SPRGMETCS662 A2, Jan 25th to May 3rd 2023
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| W | 06:00 PM | 08:45 PM | CAS | 426 |
Restrictions: Not for CS Majors