CS 453/553: Introduction to Theory of Computation

Prof. Jason Sauppe | Spring 2025

This page contains a course schedule for CS 453/553. Rows in gray are tentative and will be updated as the course progresses. Other course content (e.g., assignments) can be found on Canvas.

Content	Week	Day	Date	In-Class	Reading	Assignments
Introduction & Mathematical Preliminaries	01	Mon.	01/27		Syllabus, 0.1
		Wed.	01/29		0.2
		Fri.	01/31
Proofs, Induction, & Languages	02	Mon.	02/03		0.3, 0.4
		Wed.	02/05
		Fri.	02/07
Finite Automata	03	Mon.	02/10		1.1
		Wed.	02/12
		Fri.	02/14
Nondeterminism	04	Mon.	02/17		1.2
		Wed.	02/19			Assignment 1 available
		Fri.	02/21
Regular Expressions & Languages	05	Mon.	02/24
		Wed.	02/26		1.3, 1.4
		Fri.	02/28
Exam 1	06	Mon.	03/03	Review
		Wed.	03/05	Review
		Fri.	03/07	Exam 1
Context-free Grammars & Pushdown Automata	07	Mon.	03/10		2.1
		Wed.	03/12			Assignment 1 due
		Fri.	03/14		2.2
Spring Break		Mon.	03/17	—No Class—
		Wed.	03/19	—No Class—
		Fri.	03/21	—No Class—
Pushdown Automata	08	Mon.	03/24
		Wed.	03/26		2.2
		Fri.	03/28
Context-free Languages	09	Mon.	03/31
		Wed.	04/02		2.3	Assignment 2 available
		Fri.	04/04
Turing Machines	10	Mon.	04/07		3.1
		Wed.	04/09
		Fri.	04/11		3.2
Decidability	11	Mon.	04/14		3.3
		Wed.	04/16	—Class Cancelled—
		Fri.	04/18		4.1
Decidability & Reducibility	12	Mon.	04/21		4.2
		Wed.	04/23
		Fri.	04/25		5.1, 5.2	Assignment 2 due
Exam 2 & Reducibility	13	Mon.	04/28	Review
		Wed.	04/30	Exam 2		(Optional) Assignment 3 available
		Fri.	05/02		5.3, 6.3
Time Complexity	14	Mon.	05/05		7.1, 7.2
		Wed.	05/07		7.3 - 7.5
		Fri.	05/09	Review		(Optional) Assignment 3 due
Final Exam	15	Thu.	05/15	—Final Exam (12:15 PM – 2:15 PM) —