Question: State whether the language is regular or not and prove your answer: {w of the form: + =, , where each of the substrings ,
State whether the language is regular or not and prove your answer:
{w of the form:
In this case it is not regular. Please use pumping lemma to show it and show that one element in the language doesnt satisfy the lemma and pumping makes a string not part of the language.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
