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.
FALL 2026 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A1 |
Temkin |
CGS 521 |
T 6:00 pm-8:45 pm |
|
FALL 2026 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A2 |
Naidjate |
CAS 204A |
R 6:00 pm-8:45 pm |
|
SPRG 2027 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A1 |
Naidjate |
|
M 6:00 pm-8:45 pm |
|
SPRG 2027 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A2 |
Naidjate |
|
W 6:00 pm-8:45 pm |
|
Note that this information may change at any time. Please visit the MyBU Student Portal for the most up-to-date course information.
