Call Number | 10751 |
---|---|
Day & Time Location |
MW 10:10am-1:20pm To be announced |
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/27-07/03 (A) |
Department | Computer Science |
Enrollment | 22 students (120 max) as of 9:05PM Wednesday, April 2, 2025 |
Subject | Computer Science |
Number | W3261 |
Section | 001 |
Division | Interfaculty |
Section key | 20252COMS3261W001 |