COSC 383 - Assignment 1  Due on Sept. 17, 2001


1.  Construct a DFA for the following languages.  Assume {0,1} as the 
    alphabet.

a.  Accept all strings of length 3n.

b.  Accept all strings of length 3n or 4n.

c.  Accept strings S such that every substring of length 5 contains
    at least two 0's