Assigment 2:  (Due October 4)


P1: Construct a FA that will accept the set of strings w over the alphabet
    {a,b} satisfying the property that either w has two consecutive 
    occurences of the letter `a' or it has three consecutive 
    occurences of the letter `b'.

P2: Construct a FA that will accept the set of strings w over the alphabet
    {a,b} satisfying the property that w has two consecutive
    occurences of the letter `a' and  it has three consecutive 
    occurences of the letter `b'.