Spring 2024 Computer Science W3261 section 022

COMPUTER SCIENCE THEORY

Call Number 12073
Day & Time
Location
TR 11:40am-12:55pm
501 Northwest Corner Building
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 152 students (160 max) as of 3:06PM Sunday, June 23, 2024
Subject Computer Science
Number W3261
Section 022
Division Interfaculty
Campus Morningside
Section key 20241COMS3261W022