Computer Language Theory

MET CS 662

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.

FALL 2017 Schedule

Section Instructor Location Schedule Notes
B1 Temkin CGS 515 T 6:00 pm-8:45 pm Class Closed

FALL 2017 Schedule

Section Instructor Location Schedule Notes
B2 Naidjate CGS 525 T 6:00 pm-8:45 pm

SPRG 2018 Schedule

Section Instructor Location Schedule Notes
B1 Naidjate CAS 237 T 6:00 pm-8:45 pm

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.