| Call Number | 12073 |
|---|---|
| Day & Time Location |
TR 11:40am-12:55pm To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Mihalis Yannakakis |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | 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. |
| Web Site | Vergil |
| Department | Computer Science |
| Enrollment | 150 students (150 max) as of 4:09PM Sunday, December 10, 2023 |
| Status | Full |
| Subject | Computer Science |
| Number | W3261 |
| Section | 022 |
| Division | Interfaculty |
| Campus | Morningside |
| Section key | 20241COMS3261W022 |