CS E6831 HW 6 04f  Due 10/20/04

READ: In text (Essence...) 6.1, ASYNC (handout) Chapter 2 thru 2.2.

PROBLEMS: In text: 6.7, 6.8.  In ASYNC, 2/(1-4)

  NON-TEXT

   NT1. Find a single sequence that covers all three of the following
   sequences: 01--1101-, 0-1-11-11, -110---1- (or say why this can't
   be done.)

   NT2. For the following set of sequences, find the maximal
   compatible subsets (i.e., compatible subsets that cannot be
   enlarged by adding additional sequences from the set.)  For each
   subset find the sequence with the most dashes that covers all the
   members.

     a:  0 1 1 0 - 1 -
     b:  0 1 - 1 - 1 -
     c:  0 1 - - 1 1 -
     d:  - 1 - 1 1 1 0