Course Information

Syllabus (pdf)

LaTex

Introduction to LaTex

LaTex Primer

LaTex Cheat Sheet

Drawing DFAs

Drawing DFAs

Online DFA Drawing Tool

Online DFA Tester

Online DFA Animator

Class Schedule

Date	Lecture Topics	Sections	Assignment	Assignment Due
W 8/27	Introduction and Review Full	0.1 - 0.2
M 9/1	NO CLASS - LABOR DAY
W 9/3	Review Full Finite Automata Full	0.3 - 0.4 1.1	Homework 1 hw1.tex ch1ex.tex
M 9/8	Nondeterminism Full	1.2
W 9/10	Closure Properties Full	1.2	Homework 2 hw2.tex	Homework 1
M 9/15	Regular Expressions Full	1.3
W 9/17	Regular Expressions Full	1.3	Homework 3 hw3.tex	Homework 2
M 9/22	Nonregular Languages Full	1.4
W 9/24	Context-Free Grammars Full	2.1	Homework 4 hw4.tex	Homework 3
M 9/29	Pushdown Automata Full	2.2
W 10/1	Non-Context-Free Languages Full	2.3	Homework 5 hw5.tex	Homework 4
M 10/6	More on the Pumping Lemma Full	2.3
W 10/8	More on the Pumping Lemma Full	3.1	Writing Requirement
M 10/13	Turing Machines Full	3.2	Homework 6 hw6.tex	Homework 5
W 10/15	MIDTERM
M 10/20	Variants of Turing Machines Full
W 10/22	Definition of an Algorithm Full	3.3	Homework 7 hw7.tex hw7PDAtable.tex	Homework 6
M 10/27	Decidable Languages Full	4.1
W 10/29	Undecidability Full	4.2	Homework 8 hw8.tex	Homework 7
M 11/3	Undecidability Full	4.2
W 11/5	Undecidable Problems Full	5.1	Homework 9 hw9.tex	Homework 8
M 11/10	A Simple Undecidable Problem Full	5.2
W 11/12	Measuring Complexity Full	7.1	Homework 10 hw10.tex PCPlatexexamples.pdf PCPlatexexamples.tex	Homework 9
M 11/17	The Class P Full	7.2
W 11/19	The Class NP Full	7.3	Homework 11 hw11.tex	Homework 10
M 11/24	REMOTE CLASS - Catch-up
W 11/26	NO CLASS - THANKSGIVING BREAK
M 12/1	NP-Completeness Full	7.4-7.5		Homework 11
W 12/3	Final Review
M 12/8	FINAL EXAM 9:00-12:00 (Section 2)
W 12/10	FINAL EXAM 2:00-5:00 (Section 1)