Barnard College

COMS W 3261x and y Computer Science Theory

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. - M. Yannakakis
Prerequisites: COMS W3203. Corequisites: COMS W3134, W3136, or W3137. BC: Fulfillment of General Education Requirement: Quantitative and Deductive Reasoning (QUA)..
3 points

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Autumn 2014 :: COMS W3261
COMS
3261
61565
001
MW 1:10p - 2:25p
833 SEELEY W. MUDD BUILDING
A. Aho 105 / 120 [ More Info ]
Spring 2015 :: COMS W3261
COMS
3261
61583
001
TuTh 11:40a - 12:55p
TBA
T. Malkin 111 / 104 [ More Info ]
COMS
3261
67746
002
TuTh 10:10a - 11:25a
TBA
T. Malkin 71 / 104 [ More Info ]