Due Monday 1/7
Read Chs 1 & 2
Do Ch. 2 - 1,4,5,7,10,13,15,16,17,19

Due Wednesday 1/9
Read Chs 3 & 4
Do Ch. 3 #1,15,16,17,19
   Ch. 4 #2-9
   
Due Friday 1/11
Read Ch. 5
Do Ch. 4 #15i,18
   Ch. 5 #2,3,5,6,7,9,10,11,12,17
   
Due Monday 1/14
Read Ch. 6
Do Ch. 6 #2(for machines 3 and 6),5,6,7,9,11,12i,16,19

Due Wednesday 1/16
Read Ch. 7
Do Ch. 7 #1,3i,5iv,6i,20!
(! denotes an interesting result!)

In Ch. 7, you might find the algorithms developed in class to
be easier than those in the book. If so, use mine; if not, use
those from the book. We will be skipping the algorithm in the
Proof 2 of Th. 7. Do be aware of the results on NFAs but don't
bog down in that proof. If you consider it, please make corrections
found on the Errata Page. However, note that some material being covered
in class, e.g. cardinaity results and determining equality of regular
languages is not in the book.

If you're reading ahead, note that we're skipping Ch. 8
for a few days.

Due Friday 1/18
Read Ch. 9 (It's short.)
Ch. 9 #1,11,20.
In #1 and #11 please produce an extended transition table as
exemplified on the handout which show T/F for the final states
and determine whether l1 is a subset of L2, or vice versa, and
if L1 = L2.
In #20, make it read: ...Find a property and a collection of languages
that are closed under union and intersection with respect to that property
but not under complementation.

Due Monday 1/21
Read Ch. 10 up to the middle of p. 196.
Do #1 i and ii, similar to a^n b^n; use Th. 13
   #3,  similar to PALINDROME, use Th. 14
   #6i, similar to PRIME (hint: (n+1)^2 - n^2 = 2n+1.)
   #13i
   #17
   
Due Wed 1/23
Read Ch. 11
Do #1,3,6,8,9,11,12,13,20
On #8, I think 28 will suffice for a three-state FA.

Due Friday 1/25
Read Ch. 8
Do Ch. 8, p. 164, #1iii,3iii,6iii,8(for 3iii),9(for 6iii),10,12

There will be a test over Part I on Monday,
plus a take-home due on Friday.

From Wednesday - due Wednesday after mid-term break:
Read Ch 12,
Do Ch. 12  #3,7,8,11,13,15ix,16i,18v,19v

From Friday - also due Wednesday
Read Ch. 13
Do Ch. 13 - 1ii,2ii,6,7,8i,9,11,13,14,15,17

Due Friday 2/8
Read Ch. 14
Do #3,4,9,10,11,14,20i,ii 

Due Monday 2/11
Consult the  Errata  sheet.
Read Ch. 15 up to p. 327.
Take a break.
Read the rest of the chapter.
Do #1i).
Do #13 and 14. Use the PDA given; a simpler PDA for the same language
  is possible but you'll learn more by using the one given. 
Read the Chapter again will an eye toward the generality of the methods.  

Do Wed 2/13
Read Ch. 16
Due Ch. 16 #5,13,14,15,18

Due Fri 2/15
Read Ch. 17
Do Ch. 17 #1i,ii;2i;3i,ii,iii;5i-iv;7iii(L1L2 not L1,L2)
  8i, 11, 12(cf. #16 in Ch. 16), 14
  
Due Mon 2/18
Read Ch. 18
Do Ch. 18 #1iv,v;3i,vi;8;10;13iii;14iii,15iv,v

For Mon 2/25
Take-home Portion of Exam 2 is due
Read Ch. 19

Due Wed 2/27
Do Ch. 19 #1iii,2,5(include outline),19
Read Ch. 20
Do Ch. 20 #4,10,12(incl. outlines),17(incl.outline)

No class on Friday!
For Monday, use the Turing Machine simulator, known as 
Turing's World for one of the problems below; your choice. 
Turing's World is available as a Mac App on the Macs on the first floor.
It should be at  
   Fabio_USR/Course/MacIntosh/Turing's World
It should be self-explanatory. If not try Turing' World.
I have requested that the book, "Turing's World 3.0 for the Mac" by Barwise
be put on closed reserve for this course.

 
The Problems are:
I think you can do elementary arithmetic in Turing's World,
such things as adding, absolute subtraction, multiplying,
divide and remainder, squaring, and integer square root -- in unary!
Try any one (or more) of these.
Or similar problems in binary.
Or similar problems of a computational nature.

Due: Monday 3/4

You can work in pairs, in which case you should have at least
two programs. You can work in triples, in which case you should have at least
three programs. Etc.

Deliverables: Turn in hard copies documenting your work

Reading: Before reading in Chs. 21 and 22, think about how you would
represent and simulate machine X on machine Y. Then read the corresponding
sections of the text.  Don't memorize representations and simulations;
rather, build up your intuition and use the text for verification.

In Ch. 22, we'll consider the NTM (pp.518-524) on Monday, and won't be
considering The Read-Only TM (pp. 524-531).

Besides Turing's World and the readings, put some time in on your projects.
Let me know if you run out of things to do.

Due Wed 3/6
Ch. 22 #16iii
Ch. 25 #4

Due Fri 3/8 
Ch. 23 #13 iv (pp. 562-564), #20
 
Due Mon 3/11
Ch. 24 #4i,6