Let E = {0, 1, 2, 3, 4,5,6, 7,8,9, +,=} and consider the language L of...

Transcribed Image Text:

Let E = {0, 1, 2, 3, 4,5,6, 7,8,9, +,=} and consider the language L of all strings over E that constitute a valid and correct equation of the form a + 6 = c where a, b, c are non-negative integers represented in base 10, without leading zeros. Some elements ofL include 13+17 = 30 and 99 +0 = 99, but not 13+ 17 = 29 (wrong arithmetic) or 99 +01 100 (leading zero in the number 1). Use the Pumping Lemma to prove that L is not regular. %3D Let E = {0, 1, 2, 3, 4,5,6, 7,8,9, +,=} and consider the language L of all strings over E that constitute a valid and correct equation of the form a + 6 = c where a, b, c are non-negative integers represented in base 10, without leading zeros. Some elements ofL include 13+17 = 30 and 99 +0 = 99, but not 13+ 17 = 29 (wrong arithmetic) or 99 +01 100 (leading zero in the number 1). Use the Pumping Lemma to prove that L is not regular. %3D

Answer rating: 100% (QA)

For sake of contradiction assume instead L is regul... View the full answer