963 views
1 votes
1 votes

The answer given is NO

I have a doubt. When concatenating two languages, we take the strings of the first language and concatenate it with each string of the second language. So if I go by the definition only, the above statement is correct.

But by taking a few examples, it seems that when we concatenate two languages, some of the strings comes out to be the same. The final concatenated language will contain strings less than |L1| * |L2|.

Therefore, the correct relation should have been |L1. L2| <= |L1| x |L2|.

Is this the right logic to answer this question? Or did I miss out on any conceptual reasons?

1 Answer

1 votes
1 votes

Yes that's correct. For eg. for ∑ as {0,1}

take L1 = {0,01} and L2 = {∈,1}

then L1.L2= {0,01,011}

so |L1.L2| = 3 and |L1|*|L2| = 2*2 =4

Related questions

5 votes
5 votes
4 answers
1
Purple asked Jan 28, 2016
8,893 views
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular.(a) L2 is definitely regular(b) L2 may not be regular(c) L2 is context free(d) None of aboveIs it option B ...
0 votes
0 votes
0 answers
2
Sandeep Verma asked Nov 13, 2017
345 views
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
3 votes
3 votes
2 answers
3
Sandeep Verma asked Nov 12, 2017
2,319 views
If a language(L1) is Recursive enumerable (RE) and L2 is Recursive (REC) , then what will be L1 - L2 ? Can we directly use set difference property or do the s...