This question already has an answer here:
- How to prove that a language is not regular? 10 answers
I am unsure of how to prove this language is non-regular. I do not even know where to start to develop a string that would prove the language is non-regular by contradiction. Any help would be appreciated.
I understand that the string has to have a length greater than the pumping length of L. What does that even mean in this context of such a vast alphabet?
I imagine I have to choose a string that fits the properties:
must be in the form of the expression a+b=c no leading zeros in a,b,c the expression on the left must equal the value on the right But I do not know what string would fit all these properties but also provides a contradiction in the proof.