| Call Number | 10984 |
|---|---|
| Day & Time Location |
MW 1:00pm-4:10pm To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructors | Xi Chen Timothy W Randolph |
| Type | LECTURE |
| Course 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. |
| Web Site | Vergil |
| Subterm | 05/22-06/30 (A) |
| Department | Computer Science |
| Enrollment | 34 students (120 max) as of 1:06PM Saturday, May 10, 2025 |
| Subject | Computer Science |
| Number | W3261 |
| Section | 001 |
| Division | Interfaculty |
| Campus | Morningside |
| Section key | 20232COMS3261W001 |