CSC 341 Grinnell College Spring, 2014
 
Automata, Formal Languages, and Computational Complexity
 

Tentative Class Schedule

Monday Wednesday Friday
January 20
Introduction
Mathematical Preliminaries
Read: Sipser, Sec. 0.1-0.2
January 22
Proofs and Proof Techniques
    Proofs by Construction
    Proofs by Contradiction
Read: Sipser, Sec. 0.3-0.4
January 24
More Proof Techniques
    Proofs by Induction
Read: Sipser, Sec. 0.4
January 27
Finite Deterministic Automata
Read: Sipser, Sec. 1.1
January 29
Finite Nondeterministic Automata
Read: Sipser, Sec. 1.2
January 31
Regular Expressions
Read: Sipser, Sec. 1.3
February 3
Nonregular Languages
The Pumping Lemma
Read: Sipser, Sec. 1.4
February 5
Review of Regular Languages
February 7
Context-free Grammars
Read: Sipser, Sec. 2.1
February 10
Pushdown Automata
Read: Sipser, Sec. 2.2
February 12
Non-context-free Languages
Another Pumping Lemma
Read: Sipser, Sec. 2.3
February 14
Turing Machines
Read: Sipser, Sec. 3.1
February 17
Test 1
February 19
More Turing Machines
Examples
February 21
Variants of Turing Machines
Read: Sipser, Sec. 3.2
February 24
Algorithms
Read: Sipser, Sec. 3.3
February 26
Decidable Languages
Read: Sipser, Sec. 4.1
February 28
The Halting Problem
Read: Sipser, Sec. 4.2
March 3
Turing-Recognizable Languages
March 5
no class
March 7
Recursive Function Theory
March 10
Countability and
    Uncountability
Read: Sipser, Sec. 4.2
March 12
Decidability
The Chomsky Language Hierarchy
March 14
Test 2
March 17
Break
March 19
Break
March 21
Break
March 24
Break
March 26
Break
March 28
Break
March 31
Undecidable Problems
    from Language Theory
Read: Sipser, Sec. 5.1
April 2
Undecidable Problems, Continued
Read: Sipser, Sec. 5.2
April 4
 
Film
April 7
Mapping Reducibility
Measuring Complexity
Read: Sipser, Sec. 5.3, 7.1
April 9
Class P
Read: Sipser, Sec. 7.2
April 11
Class NP
Read: Sipser, Sec. 7.3
April 14
NP-completeness
Read: Sipser, Sec. 7.4
April 16
NP-complete Problems
Read: Sipser, Sec. 7.5
April 18
Directions for CSC 341
Administrivia
Class Discussion
April 21
Approximation Algorithms
Read: Sipser, Sec. 10.1
April 23
Probabilistic Algorithms
Read: Sipser, Sec. 10.2
Take-home Test Distributed
April 25
Cryptography
Read: Sipser, Sec. 10.6
April 28
Class Presentations on
    NP Complete Problems
April 30
Class Presentations on
    NP Complete Problems
Some Number Theory
Take-home Test Due
May 2
 
Pause for Breath
May 5
Class Presentations on
    NP Complete Problems
May 7
Cryptography
May 9
Review
End-of-course Evaluations


This document is available on the World Wide Web through the course home page at

http://www.cs.grinnell.edu/~walker/courses/341.sp14/

created 30 December 2013
revised 31 December 2013-5 January 2013
Valid HTML 4.01! Valid CSS!
For more information, please contact Henry M. Walker at walker@cs.grinnell.edu.