Comment:
This builds on the previous example by adding a lab.
NOTE: The "virtual Monday" on 2 FEB is NOT actually in the 2006 Calendar!
:endComment:

DateRange:
  8 1 2006
  22 2 2006
:endDateRange:

Holidays(blocking):
  MLK Day 16 1 2006
  Presidents Day 20 2 2006
:endHolidays(blocking):

Holidays(non-blocking):
  Add Deadline 20 1 2006
  Prereg Begins 23 1 2006
:endHolidays(non-blocking):

Virtual_Days:
  Monday 2 2 2006
:endVirtual_Days:

Topics: Numbered_Topics "Class $: " MW
  Intro: course, alphabet, language.
  Introducing finite automata and JFLAP.
  Complement, instersect machines with diagrams
  Set Theory Basics
  A formal definition of a DFA
  Functions and Formal Algorithms <br/><span class="red">(<a href="quiz/Q01/Quiz.html">Quiz 1</a> Due 9/6)</span>
  More formal algorithms
  More formal algorithms
*Exam
  Configurations and a formal def of accept/reject
  Finishing configurations and started NDFAs
  Constructing NDFAs &amp; formal definition of NDFAs
  More algorithms for NDFAs <br/><span class="red">(<a href="quiz/Q02/Quiz.html">Quiz 2</a> Due 9/19)</span>
  Reviewing Algorithms &amp; Notation
  Reprising Proof &amp; Algorithm
  Converting NDFAs to DFAs
  Converting NDFAs to DFAs II
:endTopics:

Topics: Numbered_Topics "Lab $: " R
  Build your own DFA
  Build your own NDFA
  Securing your Turing machine
  Networked Turing Machines
  Microsoft .TM Technology
:endTopics: