Let L be the language {aaaba, aabaa, abbba, ababa, aaaaa}. Identify each of the REs below as defining a language that (i) contains no strings in L, (ii) contains only some strings in L and some other strings, (iii) contains all strings in L and some other strings, or (iv) is the same as L.
a. a(a|b)*abb(a|b)*
b. a(a|b)*a
c. a*b*aba
d. a ((a*|b*)|(b*aba*))a
e. a*b*aa*b*ba*a*a*b*b*a*a*b*
f. (a|b)(a|b)(a|b)(a|b)a
g. (a|aa|aaa)(ba|aa|bbb)a
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.