Tuesday April 2, 2013
Due Today:
Announcements:
Readings:
        Chapter 0, Introduction pp. 1-30.
        Chapter 1, Finite Automata pp 31-44.
Class Topic:
        Mathematical preliminaries.
        Finite State Automata (DFA).
        Proofs by Induction.
Worksheet:
        Worksheet 1.  Due by midnight April 4, 2013.
Assigned today:
        homework 1. Due before class April 9, 2013.

Tuesday April 9, 2013
Due Today:
        homework 1.
Announcements:
        You may turn in a paper copy in class (in addition to the D2L copy)
                to the TA can mark it up and return it to you.
        Please start every homework with a line with three things:
                homework number, your name, and your email. It should look like this

                CS581  Homework #1    Tom Smith   tsmith@cs.pdx.edu
Readings:
        Chapter 1. pp 31-62
Class Topic:
        Closure Properties of DFAs
        Nondeterministic State Automata (NFA)
        NFA with epsilon transitions (NFAe)
        Closure properties of NFAs
Worksheet:
        Worksheet 2. Due by midnight Thursday, April 11, 2013.
Assigned today:
        homework 2. Due before class April 16, 2013.

Tuesday April 16, 2013
Due Today:
        homework 2.
Announcements:
Readings:
        Chapter 1 pp 63-98
Class Topic:
        Equivalence of DFA NFA
        Regular Expressions (RE)
        Equivalence of RE and (DFA,NFA,NFAe)
        Pumping Lemma
Worksheet:
        In class worksheet
                (work in pairs, both in class and for Thursday's worksheet. Each person should turn something into D2L).
Assigned today:
        homework 3. Due before class April 23, 2013.

Tuesday April 23, 2013
Due Today:
        homework 3.
Announcements:
        Some notes on what you should know to take the midterm.
Readings:
        Chapter 2 pp. 99-122
Class Topic:
        Guest Lecture by Jim Hook (while Tim attends the Types Workshop).
        Context Free Grammars (CFG)
        Push Down Automata (PDA)
        CFG and PDA are equivalent.
Worksheet:
        Worksheet 4. Due by midnight Thursday, April 25, 2013.
Assigned today:
        homework 4. Due before class April 30, 2013.

Tuesday April 30, 2013
Due Today:
Announcements:
        The exam will be "open book" in that each student may bring
        one 8.5" by 11" piece of paper with notes. The exam will
        cover all the material. Questions about the Context Free
        languages (the lecture by Prof Hook) will be limited to basic
        understanding, so it will not have questions about detailed
        constructions.
Readings:
        Chapter 2 pp. 123-134
Class Topic:
        Mid term exam (proctored by Ki-Yung Ahn).
        Guest Lecture by Ki-Yung
        CF Pumping Lemma
        Context Free Language big picture.
Worksheet:
        Worksheet 5. Due by midnight Thursday, May 2, 2013.
Assigned today:
        No homework assigned today. There is a Worksheet however (see above).

Tuesday May 7, 2013
Due Today:
Announcements:
Readings:
        Chapter 3 pp 135-164
Class Topic:
        Turing Machines
Worksheet:
        Worksheet 6.  Due by midnight May 9th, 2013.
Assigned today:
        homework 5 due Tuesday May 14, 2013.

Tuesday May 14, 2013
Due Today:
        homework 5.
Announcements:
Readings:
        Chapter 4 pp 165-186
Class Topic:
        Go over Midterm exam. Compare your results. See D2L for a partial solution.
        Turing Machine Variants
        Algorithms and the Church-Turing Thesis
        Decideability, the halting Problem, diagonalization.
Worksheet:
        Worksheet 7.  Due by midnight May 16th, 2013.
Assigned today:
        homework 6 due Tuesday May 21, 2013.

Tuesday May 21, 2013
Due Today:
        homework 6.
Announcements:
Readings:
        Chapter 5 pp. 187-216
Class Topic:
        Reducability
Worksheet:
        Worksheet 8.  Due by midnight May 23th, 2013.
Assigned today:
        Homework 7 due Tuesday May 28, 2013.

Tuesday May 28, 2013
Due Today:
        Homework 7.
Announcements:
Readings:
        Chapter 6 pp. 217-242
Class Topic:
        The Recursion Theorem
        Logic and Decidability (we didn't get to this)
        Information Theory     (we didn't get to this)
Worksheet:
        No worksheet today.
Assigned today:
        Homework 8 due Tuesday June 4, 2013.

Tuesday June 4, 2013
Due Today:
        Homework 8.
Announcements:
Readings:
        Chapter 7. pp. 245-276
Class Topic:
        Complexity, P and NP, NP Completeness
        Patterns of reducability
        Final Exam Study Guide
        Course Evaluations
Worksheet:
        Worksheet 9.  Due by midnight June 06, 2013.
Assigned today:
        Homework 9 due Tuesday June 11, 2013.

Tuesday June 11, 2013
Due Today:
        Homework 9
Final Exam period 15:30 -> 17:20 (3:30 -> 5:20 PM)
The University scheduled final exam period is not the same as normal class hours!