| Call Number | 10350 |
|---|---|
| Day & Time Location |
MW 1:00pm-4:10pm 833 Seeley W. Mudd Building |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Xi Chen |
| 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 |
| Subterm | 05/20-06/28 (A) |
| Department | Computer Science |
| Enrollment | 36 students (99 max) as of 12:06PM Saturday, February 8, 2025 |
| Subject | Computer Science |
| Number | W3261 |
| Section | 001 |
| Division | Interfaculty |
| Section key | 20242COMS3261W001 |