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 General Education Requirement: Quantitative and Deductive Reasoning (QUA).
3 points Lect: 3.

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Spring 2014 :: COMS W3261
COMS
3261
26862
001
TuTh 2:40p - 3:55p
833 SEELEY W. MUDD BUILDING
A. Lewko 112 / 120 [ More Info ]
Autumn 2014 :: COMS W3261
COMS
3261
61565
001
MW 1:10p - 2:25p
TBA
A. Aho 100 / 100 [ More Info ]