6. (10 pts) Is L regular? Either prove that it is not regular using pumping lemma, or describe an RE for it. The alphabet of the language is {0, 1,+,=}.
L = {x = y + z |, y, z are binary integers, and x is the sum of y and z }
For example, strings 1000 = 101 + 11, 0101 = 010 + 11, and 101 = 101 + 0 are in the language, but strings 100 = 101 + 10, 1 = 1 = 1, 1 + 1 = 10, and 1111 are not in the language.