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.
FALL 2014 Schedule
|C1||Temkin||CGS 515||W 6:00 pm-9:00 pm|
SPRG 2015 Schedule
|A1||Temkin||CGS 525||M 6:00 pm-9:00 pm|
Note: this course was also offered during Summer Term