MET CS 662 Computer Language Theory

Prerequisites: MET CS 248. Or instructor’s consent
Delivery: Boston-Charles River Campus
Program: MS CS core
Syllabus: CS662_B1_Spring2016

Description: 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. 4 credits.