Call Number | 12349 |
---|---|
Day & Time Location |
MW 1:10pm-2:25pm To be announced |
Points | 3 |
Grading Mode | Standard |
Approvals Required | None |
Instructor | Mihalis Yannakakis |
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 (110 max) as of 10:05AM Friday, October 10, 2025 |
Subject | Computer Science |
Number | W3261 |
Section | 001 |
Division | Interfaculty |
Section key | 20261COMS3261W001 |