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: + =, , where each of the substrings , ,, and is an element of {0 - 9}* and integer3 is the sum of integer1 and integer2}. For example, 124+5=129 L


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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!