486 views

2 Answers

2 votes
2 votes

I eliminated all the other 3 options,by counter example. Hence option a is the correct answer.

0 votes
0 votes

Actually the answer given is wrong.

Neither of them is correct.

(a+b)* also contains those string which have a after b or have a substring of abab and many more permutations.

The correct ans would be {anbm | m,n>=0} 

Proof:

L1: anb| n,m >=0 

L2 : anbm| m=n

L2' : anbm | m!=n

 Now L2' is a subset of L1 as L1 will contain all the string of form a^nb^n, 

SetA  (union) subset of SetA = SetA

Therefore L will be L1 only.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
hasina ali asked Mar 21
105 views
Set of binary strings starting with 11 and ending with 00. E.g., 1100,1110100 ,1100100
0 votes
0 votes
1 answer
3
utsav22222 asked Mar 15
183 views
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.