| Call Number | 13540 |
|---|---|
| Day & Time Location |
TR 10:10am-11:25am To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Tal Malkin |
| Type | LECTURE |
| Method of Instruction | In-Person |
| 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 |
| Department | Computer Science |
| Enrollment | 0 students (105 max) as of 7:05PM Friday, April 10, 2026 |
| Subject | Computer Science |
| Number | W3261 |
| Section | 002 |
| Division | Interfaculty |
| Section key | 20263COMS3261W002 |