Test Series
[closed]

in Theory of Computation closed by
437 views
0 votes
0 votes
closed with the note: doubt cleared

according to me S2 should be correct. But answer given as none of them is correct. 

Please clear the doubt.

in Theory of Computation closed by
437 views

2 Comments

I think it should be false because

let L1= {bb}
L2 ={b}
then L1.L2 = bbb = L2.L1
0
0
Consider two language over $\sum =\{{a}\}$ where-

L1= #of a divisible by 2

L3=#of a divisible by 3.

Clearly L1 and L2 are two diff. language. But L1.L2=L2.L1. Is'nt it? So, S2 also False.
0
0

1 Answer

0 votes
0 votes
if L1={a},  L2={aa}  then concatenation is commutative so option S2 is wrong
edited by

3 Comments

its given that we are concatenating 2 DIFFERENT language. in your example L1 and L2 are same.
0
0

L1 = {a,aa,aaa} and L2 = { a,aa}

then S2 is False, isn't it ?

0
0
yes. i understood now. it should be false
0
0

Related questions