in Theory of Computation
459 views
1 vote
1 vote

I feel answer is C but it is given "A". anyone help?

in Theory of Computation
459 views

2 Answers

2 votes
2 votes

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

by

3 Comments

But according  to option A  string "baba" must be a part of language but it is not part of L1 U L2 compliment??


0
0
Forgot to write it,but L2$\overline{L2}$ will include $\overline{L2} \sum * - L,so that'll be included too.
0
0
Oh i got it now thak you!
0
0
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.