Question: Let the alphabet = {a, b} and consider the language L={ww we *} consisting of strings with even length, whose second half is another copy
Let the alphabet = {a, b} and consider the language 
L={ww we *} consisting of strings with even length, whose second half is another copy of the first half of the string. Prove that L is not a regular language
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
