Regular sets and finite automata. Context-free languages and push-down automata. Parsing. Computability theory including Turing machines and decidability. Course Information: Previously listed as EECS 361. Prerequisite(s): Grade of C or better in CS 151; and Credit or concurrent registration in CS 251. Class Schedule Information: To be properly registered, students must enroll in one Discussion/Recitation and one Lecture.