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. - J.
Grunschlag
Prerequisites: COMS W3203 Corequisites: COMS W3137 General Education Requirement: Quantitative and
Deductive Reasoning (QUA).
3 points Lect: 3.
|
Course Number |
Call Number/ Section |
Days & Times/ Location |
Instructor | Enrollment | |
| Spring 2013 :: COMS W3261 | |||||
|
COMS 3261 |
62897 001 |
TuTh 11:40a - 12:55p 501 NORTHWEST CORNER |
S. Choi | 99 |
![[ More Info ]](./images/moreinfo.gif)
|
| Autumn 2013 :: COMS W3261 | |||||
|
COMS 3261 |
28863 001 |
MW 1:10p - 2:25p TBA |
M. Yannakakis | 92 / 110 |
|