Suppose that for some language L we can always concatenate two words in L and get another
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 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.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Answer and Explanation Suppose that for some langua...View the full answer
Answered By
Labindao Antoque
I graduated in 2018 with a Bachelor of Science degree in Psychology from Dalubhasaan ng Lungsod ng San Pablo. I tutored students in classes and out of classes. I use a variety of strategies to tutor students that include: lecture, discussions about the subject matter, problem solving examples using the principles of the subject matter being discussed in class , homework assignments that are directed towards reinforcing what we learn in class , and detailed practice problems help students to master a concept. I also do thorough research on Internet resources or textbooks so that I know what students need to learn in order to master what is being taught in class .
0 Reviews
10+ Question Solved
Related Book For 
Question Posted:
