Spring 2024 Computer Science W3261 section 001

COMPUTER SCIENCE THEORY

Call Number 12072
Day & Time
Location
MW 2:40pm-3:55pm
417 International Affairs Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Josh Alman
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 130 students (150 max) as of 9:07PM Thursday, July 18, 2024
Subject Computer Science
Number W3261
Section 001
Division Interfaculty
Section key 20241COMS3261W001