Course Information

Syllabus (pdf)

TA:   Aya Garryyeva    lgarryyeva (at) wm.edu     T 5:00-6:00 Ewell 254
         Chen Qian           cqian03 (at) wm.edu          F 1:00-2:00 MS 139
LaTex
Introduction to LaTex

LaTex Primer

LaTex Cheat Sheet

Drawing DFAs

Drawing DFAs

Online DFA Drawing Tool

Online DFA Tester

Online DFA Animator
Final Review
J1 J2

Class Schedule

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