COMS 3261Section 002Fall 20263 creditsAlmost full
Computer Science Theory
Call number
Tuesday and Thursday
10:10am–11:25am
Location TBD
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
Description
CC/GS: Partial Fulfillment of Science Requirement Corequisites: COMS W3134,COMS W3136,COMS W3137 Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness.
Reviews
Course experience
n=52, 2000–2026
Aggregated across everyone who has taught this course.
Teaching quality
4.2 / 5
Grading fairness
4.0 / 5
Workload
4.0 / 5 · Heavy
Difficulty
3.5 / 5 · Hard
Overall sentiment
Positive
In your week
Tue8
Thu3