Description: Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisite: course 180. Designed for junior/senior Computer Science majors. Finite state machines, context-free languages, and pushdown automata. Closure properties and pumping lemmas. Turing machines, undecidability. Introduction to computability. Letter grading.
Instructor: Raghu Meka ([email protected])
Office Hours: MW - 11:30 AM to 12:30 PM at Zoom
Teaching Assistant: ****Yimeng Wang ([email protected])
Office Hours: Tu, Th - 10:00am-11:00am at TBD
Units: 4 credits