1.53)
Let ∑ = {0,1,+,=}, and
ADD
= {
x
=
y
+
z

x,y,z
are binary integers, and
x
is the sum of
y
and
z
}
*Note: to avoid confusion going forwards for this problem, I’ve used the word “equal(s)” instead
of the equality sign, as that symbol is part of the language in question.
Use the pumping lemma; assume that
ADD
is regular and conforms appropriately (let
p
be its
hypothetical pumping number).
Consider the word
w
equal to 1
p
=0+1
p
є ∑, 
w
 equals 2
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 STOUT
 Equals sign, 1J, binary integers, hypothetical pumping number

Click to edit the document details