Question: Consider the language L = { 0 n 2 | n 0 } . To prove this language is not regular, a student wrote the

Consider the language L={0n2|n0}. To prove this language is not regular, a student wrote the
following proof:
Let F={0n2|n0}.
Pick two arbitrary strings x=0i2 and y=0j2 from L, where ij.
Then, let z=02i+1.
We have that xz=0i2+2i+1=0(i+1)2inL. On the other hand, yz=0j2+2i+1, and
j2+2i+1 is not a perfect square, because we can bound it between two consecutive
perfect squares:
yz=0j2+2i+1!inLFLFLx,yzijzxyxzyzxz=0i2+2i+10i2+2i+1=0(i+1)20(i+1)2inLyz=0j2+2i+1j2+2j+1=(j+1)2i>ji=ji.
(b) Without loss of generality, we can assume that i>j.
(c) Without loss of generality, we can assume that i=j.j2+2i+1
(g)j2+2j+1=(j+1)2
To fix the proof, we should add which of the following sentences after the second sentence of the proof?
(a) Without loss of generality, we can assume that i.
(b) Without loss of generality, we can assume that i>j.
(c) Without loss of generality, we can assume that i=j.j2
(f)j2+2i+1
(g)j2+2j+1=(j+1)2
To fix the proof, we should add which of the following sentences after the second sentence of the proof?
(a) Without loss of generality, we can assume that i.
(b) Without loss of generality, we can assume that i>j.
(c) Without loss of generality, we can assume that i=j.j2
Thus, yz=0j2+2i+1!inL.
To conclude, we have shown that Fis a fooling set for L. Since Fis infinite, Lis not regular.
But, there's something wrong with this proof! Given the above definitions ofx,y, and z, give values of i and
j such that z fails to distinguish x and y(i.e.xz and yz are either both accepted or both rejected).
Which statement from the proof is not necessarily true?
(a)xz=0i2+2i+1
(b)0i2+2i+1=0(i+1)2
(c)0(i+1)2inL
(d)yz=0j2+2i+1
(e)j2
(f)j2+2i+1
(g)j2+2j+1=(j+1)2
To fix the proof, we should add which of the following sentences after the second sentence of the proof?
(a) Without loss of generality, we can assume that i.
(b) Without loss of generality, we can assume that i>j.
(c) Without loss of generality, we can assume that i=j.
 Consider the language L={0n2|n0}. To prove this language is not regular,

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!