The Gateway to Computer Science Excellence
+2 votes
45 views

Consider the following statements:
S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’.
S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’.
Which of the following is correct?

in Theory of Computation by (133 points)
edited by | 45 views
0
Both are false.
0
thanks!!

but how second one is false?

If L1={a} and L2={b} then L1.L2 != L2.L1 so how this is commutative?

can u give some example in which it is commutative
0
L1= {a} and L2= {aa} then it is commutative ryt?
0
okie thanks!!

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,390 answers
198,589 comments
105,443 users