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.

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