Spring 2026 Computer Science W3261 section 002

COMPUTER SCIENCE THEORY

Call Number 12350
Day & Time
Location
MW 2:40pm-3:55pm
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 002
Division Interfaculty
Section key 20261COMS3261W002