Automata regukar laNGUAGE


#1

Which one of the following languages over the alphabet {a, b} is described by the regular expression:
(a (ba)* (a + bb) + b (ab)* (b + aa)) (a+b)*