CS 321: Homework 2

Due date: October 15, 2008

Section 2.2: 6, 7, 10a, 12

Section 2.3: 1 (you may also use the construction taught in class), 
             3, 6, 11

Excercise A: 

Consider removing step 4 from the procedure NFA_TO_DFA on page 58 of
your text, keeping everything else unchanged. Call this modified
procedure NFA_TO_DFA*. 

Give an NFA N such that the result of running NFA_TO_DFA* produces a
DFA that is not equivalent to N. This NFA can be very small.

Now consider the procedure I taught in class (for a reminder of this see
the note on the lectures page on October 6). This procedure is the
same as NFA_TO_DFA* only we change step 1 so that the initial state is
equal to delta*(q_0,lambda) rather than {q_0}. Show that this
procedure produces the correct DFA when applied to your example NFA N.