Construct Deterministic Finite Acceptors (DFA)

Find dfa's for the following languages on ={a,b} L={:(na()nb())mod3=0)} A run in a string is a substring of length at least two, as long as possible and consisting entirely of the same symbol. For instance, the string abbbaab contains a run of b's of length three and a run of a's of length two. Find dfa's for the following languages on {a,b} L={ : every run of a 's has length either two or three } Consider the set of strings on {0,1} defined by the requirement - All strings containing 000 but not 0000 . Construct an accepting dfa