Search Results
COMS W3261 Computer Science Theory. 3 points.
CC/GS: Partial Fulfillment of Science Requirement
Prerequisites: (COMS W3203)
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.
|
Spring 2021: COMS W3261
| |||||
| Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
|---|---|---|---|---|---|
| COMS 3261 | 001/12483 | M W 4:10pm - 5:25pm Online Only |
Xi Chen | 3 | 189/235 |
|
Fall 2021: COMS W3261
| |||||
| Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
| COMS 3261 | 001/13344 | M W 2:40pm - 3:55pm Room TBA |
Xi Chen | 3 | 150/150 |
| COMS 3261 | 002/13345 | M W 4:10pm - 5:25pm Room TBA |
Xi Chen | 3 | 150/150 |