Paul Bodily About Courses Research Outreach Tips for Communicating Teaching Philosophy Vitae

Schedule

Assignments are to be submitted via Moodle before the class period following the day on which they are assigned.
DateReadingTopicAssignment
Aug 20SyllabusSyllabus, policies, businessRead the Syllabus
Aug 22pp. 1-25Intro & basic conceptshw1: 0.1-0.9
Aug 27pp. 31-43Finite automatahw2: 1.3, 1.6
Aug 29pp. 47-54Nondeterminismhw3: 1.7 (see footnote a)
Sep 3pp. 54-63Equivalence of DFAs and NFAshw4: 1.8-1.10, 1.16
Sep 5pp. 63-69Regular expressionshw5: 1.18, 1.20
Service-learning proposal
Sep 10pp. 69-76Kleene's theoremhw6: 1.19, 1.21
Sep 12pp. 77-83Nonregular languageshw7: 1.29-1.30, 1.53
Sep 17pp. 101-107Context free grammarshw8: 2.3-2.4
Sep 19pp. 107-111Ambiguity and normal formhw9: 2.1, 2.8, 2.14, 2.27
Sep 24pp. 111-116Pushdown automatahw10: 2.5 (see footnote b)
Sep 26pp. 117-124Equivalence of CFGs and PDAshw11: 2.11, 2.26
Oct 1pp. 125-129Non-context free languageshw12: 2.22, 2.30
Oct 3Review
Oct 8Midterm
Oct 10pp. 165-175Turing machines (Lecture online - No Class)hw13: 3.1-3.2, 3.5, 3.7
Oct 15pp. 176-182Variations on Turing machineshw14: 3.8 (see footnote c), 3.10-3.11
Oct 17pp. 182-187Algorithmshw15: 3.15, 3.16a-d, 3.22 (see footnote d)
Oct 22pp. 193-200Decidable languageshw16: 4.1-4.4, 4.10
Oct 24pp. 201-207Undecidabilityhw17: 4.6-4.8, 4.12
Oct 29pp. 207-210Undecidable and unrecognizable languageshw18: 4.5, 4.24, 4.30
Oct 31pp. 215-220Reducibility and the Halting Problemhw19: 5.1, 5.24
Nov 5pp. 220-226Linear-bounded TMs and More Reducibilityhw20: 5.30 (see footnote e), plus invent
an undecidable language
and prove by reduction
that it is undecidable
Nov 7pp. 234-238Mapping [many-one] reducibilityhw21: 5.4, 5.9
Nov 12pp. 275-284Big O analysishw22: 7.1-7.2, 7.28 (see footnote f)
Nov 14pp. 284-291The class Phw23: 7.3-7.4, 7.8-7.9
Nov 19pp. 292-298The class NPhw24: 7.5, 7.12
Nov 21pp. 299-311The class NP-complete & Cook-Levin Theoremhw25: 7.18, 7.21 (see footnote g), 7.38, 7.41
Nov 26FALL RECESS
Nov 28FALL RECESS
Dec 3pp. 311-322More NP-complete problemshw26: 7.29
Service-learning final report
Dec 5Review
Dec 12Final Exam @ 7:30am

The schedule is subject to change. The final is Thursday, Dec 12, 7:30-9:30 a.m. in our normal classroom.

Footnotes to homework problems

  1. For parts e and f, if you are not yet familiar with regular expressions, the '*' superscript means "0 or more copies of" and the '+' superscript means "1 or more copies of".
  2. Just state diagrams will be sufficient -- you do not need to give informal descriptions.
  3. See p. 185 for a definition of "implementation-level description".
  4. The first edition had a much better version of this problem (based on the existence of God).
  5. Do not appeal to Rice's Theorem (as does the answer in the book), rather prove these by reduction.
  6. Don't prove NP-Completeness. Instead, produce an algorithm to solve the problem and analyze its complexity.
  7. Recall from your reading that UHAMPATH is NP-Complete. Make sure you understand the definition of a simple path.

Homework numbering mapping from 2nd edition

The mapping is represented as 2e -> 3e, so, for example 0.11 in the second edition is 0.12 in the third