Question: Suppose that for some language L we can always concatenate two words in L and get another word in L if and only if the
Suppose that for some language L we can always concatenate two words in L and get another word in L if and only if the words are not the same. That is, for any words w1 and w2 in L where w1 ≠ w2, the word w1 w2 is in L but the word w1 w1 is not in L. Prove that this cannot happen.
Step by Step Solution
3.48 Rating (161 Votes )
There are 3 Steps involved in it
Answer and Explanation Suppose that for some langua... View full answer
Get step-by-step solutions from verified subject matter experts
