Previous Weeks in CSci 370

This file will contain the week-to-week reading and lecture schedules as they actually happened.  At the end of the week the "this week" page will be modified to reflect what actually happened and will be appended to this file.

Week 1: Monday, September 3

  • Topics:
    • Introduction  
  • Reading
    • Chapter 1, 2.1

Monday:

  • Labor Day (no classes or office hours)

Tuesday:

  • Introduction to the course (1.1 - 1.2)

Thursday:

  • Mathematical preliminaries (1.3)

Friday:

  • Deterministic Finite State Automata (2.1)

Other Notes:

  • Office hours resume next week

 

Week 2: Monday, Sept. 10

  • Topics:
    • Finite State Automata
  • Reading
    • 2.2 - 2.5

Monday:

  • Non-deterministic FSA (2.2).

Tuesday:

  • Equivalence of deterministic and non-deterministic FSA (2.3)

Thursday:

  • No class (unexpected dental appointment)

Friday:

  • Operations on languages

Other Notes:

  • Office Hours resume this week
  • Next Monday is the last day to drop without record.

Week 3: Monday, Sept. 17

  • Topics:
    • Regular languages
  • Reading
    • 2.4 - 2.5

Monday:

  • Regular expressions (2.4)

Tuesday:

  • Regular languages
  • No office hours today (another dental appointment)
  • Important note:  I have an (early morning) dental appointment today, and should be able to make it to lecture on time.  If I am more then ten minutes late, please accept my apologies and class is canceled for the day.

Thursday:

  • Problem presentations

Friday:

  • The pumping lemma (2.5)

Other Notes:

  • Monday is the last day to drop without record.

Week 4: Monday, Sept. 24

  • Topics:
    • DFA
  • Reading
    • 2.5 - 2.7

Monday:

  • The pumping lemma (2.5)

Tuesday:

  • No class (dental appointment)

Thursday:

  • Problem presentations

Friday:

  • Algorithms for Finite State Automata (2.6)
  • State Minimization (2.7)

Other Notes:

 

Week 5: Monday, Oct. 1

  • Topics:
    • Context Free Languages
  • Reading
    • 2.7 - 3.1

Monday:

  • State Minimization (2.7)
  • Context Free Grammars (3.1)

Tuesday:

  • Context Free Grammars (3.1)

Thursday:

  • Student presentations

Friday:

  • Discussion of mathematical induction and problem 2.13

Other Notes:

Week 6: Monday, Oct. 8

  • Topics:
    • Context Free Languages
  • Reading
    • 3.2 - 3.3

Monday:

  • An introduction to parsing (3.2)
  • PushDown Automata (3.3)

Tuesday:

  • PushDown Automata (3.3)

Thursday:

  • Student presentations

Friday:

  • No class (half the class went to the SCCC meeting in Linfield)

Other Notes:

Week 7: Monday, Oct. 15

  • Topics:
    • Context Free Languages and Push-Down Automata
  • Reading
    • 3.4 - 3.6

Monday:

  • Languages and Automata (3.4)

Tuesday:

  • Languages and Automata (3.4)

Thursday:

  • Student presentations

Friday:

  • Languages and Automata (3.4)

Other Notes:

  • Monday and Tuesday of next week (October 22 - 23) is Fall Break (no classes or office hours)

Week 8: Monday, Oct. 22

  • Topics:
    • Context Free Languages and Push-Down Automata
  • Reading
    • 3.4

Monday:

  • Fall Break (no classes or office hours)

Tuesday:

  • Fall Break (no classes or office hours)

Thursday:

  • Context Free Languages and Push-down Automata (3.4)

Friday:

  • Context Free Languages and Push-down Automata (3.4)

Other Notes:

  • Monday and Tuesday of this week (October 22 - 23) is Fall Break (no classes or office hours)

Week 9: Monday, Oct. 29

  • Topics:
    • Context Free Languages
  • Reading
    • 3.5 - 3.6

Monday:

  • Closure Properties (3.5)

Tuesday:

  • Closure Properties (3.5)

Thursday:

  • The pumping lemma for context free languages (3.6)

Friday:

  • No class (half the class at a conference)

Other Notes:

Week 10: Monday, Nov. 5

  • Topics:
    • Context Free Languages
  • Reading
    • 3.6 - 3.8

Monday:

  • Student presentations
  • Application of the pumping lemma for CFL's (3.5)

Tuesday:

  • Some algorithms for context free languages (3.7)

Thursday:

  • Chomsky Normal Form (3.7)

Friday:

  • Determinism (3.8)

Other Notes:

Week 11: Monday, Nov. 12

Topics:

  • Turing Machines
  • Reading
    • 4.1 - 4.3

Monday:

  • Evaluations
  • Student presentations

Tuesday:

  • Introduction to Turing Machines (4.1)

Thursday:

  • Introduction to Turing Machines (4.1)

Friday:

  • Computations by Turing Machines (4.2)

Other Notes:

  • Next week is Thanksgiving Break (Thursday and Friday)

Week 12: Monday, Nov. 19

Topics:
  • Turing Machines
Reading
  • 4.3

Monday:

  • Student presentations
  • Extensions of Turing Machines (4.3)

Tuesday:

  • No class today

Thursday:

  • Thanksgiving Break (no classes or office hours)

Friday:

  • Thanksgiving Break (no classes or office hours)

Other Notes:

Week 13: Monday, Nov. 26

Topics:

  • Turing Machines
  • Reading
    • 4.3 - 4.5

Monday:

  • Extensions of Turing Machines (4.3)

Tuesday:

  • Extensions of Turing Machines (4.3)
  • Nondeterministic Turing Machines (4.4)
  • Turing Enumerable Languages (4.5)

Thursday:

  • Student presentations

Friday:

  • No class (unexpected doctor's appointment)
  • Turing Enumerable Languages (4.5)

Other Notes:

Week 14: Monday, Dec. 3

Topics:

  • Turing Machines
  • Reading
    • 4.5 - 5.4

Monday:

  • Turing Enumerable Languages (4.5)
  • The Turing-Church Thesis (5.1)
  • Universal Turing Machines (5.2)

Tuesday:

  • The halting problem (5.3)

Thursday:

  • Undecidable problems (5.4)

Friday:

  • Undecidable problems (5.4)

Other Notes:

  • Thursday and Friday of next week are Reading Period.  I will hold office hours as usual, but we will not have class meetings.
  • The final exam for this class is set for Monday, Dec. 17, at noon.  If everyone will still be around on that day, we can schedule presentations from the final problem set.

 

 

 

 

 

 

 

 

 

 

 

Return to Course Home Page