Regular expressions -- Let the alphabet = {a,b}.
Write regular expressions for:

all the words that don't have both substring bba and abb.

(a+ba)*(bb+b+^)

(b+^)(ab+a)*+b*