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 2019: COMS W3261
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 3261 001/26536 M W 5:40pm - 6:55pm
Room TBA
Allison Bishop 3 106/110
COMS 3261 002/64141 M W 7:10pm - 8:25pm
Room TBA
Allison Bishop 3 102/110
Fall 2019: COMS W3261
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 3261 001/35942 T Th 2:40pm - 3:55pm
451 Computer Science Bldg
Omri Weinstein 3 103/110
COMS 3261 002/35943 T Th 4:10pm - 5:25pm
451 Computer Science Bldg
Omri Weinstein 3 105/110