Computer Science
Based on all available term-level grade data for this course
Ranked highest to lowest GPA — using A, B, C, D, and F outcomes only
Compare a professor, browse nearby courses, or ask Sparky.
Get a quick summary of difficulty, fit, and professor picks.
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.