in Theory of Computation
388 views
1 vote
1 vote

Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈

True or false

in Theory of Computation
by
388 views

2 Comments

I think it is false!

L1= {a} L2 ={aa}

L1.L2 = L2.L1
1
1
let L1= {a}
L2 ={aa}
then L1.L2 = aaa = L2.L1
1
1

Please log in or register to answer this question.