General Information

Discussion will be held in room 176 of the Chemistry Building every Wednesday from 4:10pm to 5:00pm.

Discussion Material

Here are all the materials I've prepared for past discussions. This includes discussion and homework notes, and occasionally example JFLAP files.

Discussion 10: December 05, 2007

• Discussion Notes [pdf]
  The subset-sum problem, and what theorems you need to prove it is NP-complete.
  
  
• Handwritten Notes Page 1 [png]
  Handwritten Notes Page 2 [png]
  Handwritten Notes Page 3 [png]
  Handwritten illustration of showing the 3SAT problem polynomial-time mapping reduces to SUBSET-SUM.
  
  
• Homework Hints [pdf]
  Hints for homework 09.

Discussion 09: November 28, 2007

• Discussion Notes [pdf]
  Mapping reducibility, emptiness problem, equivalence problem, guide to classifying languages.
  
  
• Homework Hints [pdf]
  Hints for homework 08.
  
  
• Grading Notes [pdf]
  Grading notes for homework 07.

Discussion 08: November 21, 2007

• (Partial) Discussion Notes [pdf]
  Beyond Turing machines, acceptance problem, halting problem, and emptiness problem.

Discussion 07: November 14, 2007

• Discussion Notes [pdf]
  Decision procedures as TMs, closure properties of Turing decidable and Turing recognizable languages, and decidability proof of INFINITE_DFA.
  
  
• Homework Hints [pdf]
  Hints for homework 07.
  
  
• Grading Notes [pdf]
  Grading notes for homework 05.

Discussion 06: November 07, 2007

• Discussion Notes [pdf]
  PDA computation, PDA and DFA intersection, language hierarchy, and multi-tape TMs.
  
  
• Homework Hints [pdf]
  Hints for homework 06.
  
  
• Context-Sensitive Grammar [jff]
  Turing Machine [jff]
  Example JFLAP files for CSGs and TMs.

Discussion 05: October 31, 2007

• Discussion Notes [pdf]
  Chomsky normal form.
  
  
• Homework Hints [pdf]
  Hints for homework 05.
  
  
• Pushdown Automaton [jff]
  Example JFLAP file for a PDA.

Discussion 04: October 24, 2007

• Discussion Notes [pdf]
  Proving a language is regular, proof by counterexample, and context-free grammars.
  
  
• LaTeX Source [tex] [pdf]
  Simplified and self-contained LaTeX source for discussion notes.
  
  
• Homework Hints [pdf]
  Hints for homework 04.
  
  
• Grading Notes [pdf]
  Grading notes for homework 03.

Discussion 03: October 17, 2007

• Discussion Notes [pdf]
  Decision procedures and examples.
  
  
• Homework Hints [pdf]
  Hints for homework 03.
  
  
• Grading Notes [pdf]
  Grading notes for homework 02.

Discussion 02: October 10, 2007

• Discussion Notes [pdf]
  LaTeX notation, using JFLAP, other regular operations (concatenation and intersection), mod examples 1.13 and 1.15, and converting an NFA to a DFA example.
  
  
• Homework Hints [pdf]
  Hints for homework 02.
  
  
• Example Moore Machine [jff]
  RESET DFA Example [jff]
  Example JFLAP files from discussion.

Discussion 01: October 3, 2007

• Discussion Notes [pdf]
  Example minimal DFA proof.
  
  
• Homework Hints [pdf]
  Hints for homework 01.