Course Home Activities Academic Honesty Communication Policies Schedule Faculty (Home)

CSC 341: Automata, Formal Languages, and Complexity Theory
Fall 2018

Tentative Class Schedule

Date Topic Reading Assignment
8/31 Introduction & Preliminaries
9/03 Proofs/Proof Techniques Sipser 0.1 ~ 0.4
9/05 Proofs (Cont ...)
9/07 Deterministic Finite Automata Sipser 1.1 Assignment 01
9/10 Nondeterministic Finite Automata Sipser 1.2
9/12 Finite Automata (Cont...)
9/14 Regular Expressions Sipser 1.3 Assignment 02
9/17 Nonregular Languages Sipser 1.4
9/19 Context Free Grammar Sipser 2.1
9/21 Context Free Grammar (Cont...) Assignment 03
9/24 Context Free Languages Sipser 2.2, 2.3
9/26 Turing Machines Sipser 3.1
9/28 Turing Machines (Cont...) Assignment 04
10/01 Turing Machine Variants Sipser 3.2
10/03 Pause for breath
10/05 Hour-Exam 01
10/08 Algorithms Sipser 3.3
10/10 Decidability Sipser 4.1
10/12 Undecidability Sipser 4.2 Assignment 05
10/15 The Halting Problem
10/17 Turing-Recognizable Languages
10/19 Recursion Theorem Sipser 6.1
10/22 Fall Break
10/24 Fall Break
10/26 Fall Break
10/29 Reducibility Sipser 5.1 - 5.2
10/31 Mapping Reducibility Sipser 5.3 Assignment 06
11/02 Review (so far ...)
11/05 Hour-Exam 02
11/07 Measuring Complexity Section 7.1
11/09 Class P Sipser 7.2
11/12 Class NP Sipser 7.3
11/14 NP-Completeness Sipser 7.4
11/16 NP-Complete Problems Sipser 7.5 Assignment 07
11/19 Pause for breath
11/21 Number Theory
11/23 Thanksgiving Break
11/26 Cryptography Sipser 10.6
11/28 Cryptography Assignment 08
11/30 PSPACE & Savitch's Theorem Sipser 8.1 - 8.3
12/03 Class Presentations on NP-Complete Problems Assignment 09
12/05 Class Presentations on NP-Complete Problems (class presentation)
12/07 PSPACE Completeness Sipser 8.4
12/10 Open Problems in Automata Theory
12/12 Review
12/14 Review
12/20 Final Exam