COMS W3261x - and y Computer Science Theory

Institution:

Barnard College

Subject:

Description:

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. - J. Grunschlag Prerequisites: COMS W3137 and W3203. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect 3. 3 pts.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.barnard.edu

Phone Number:

(212) 854-5262

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.