Question: Consider the language L = { 0 n 2 | n 0 } . To prove this language is not regular, a student wrote the
Consider the language To prove this language is not regular, a student wrote the
following proof:
Let
Pick two arbitrary strings and from where
Then, let
We have that inL. On the other hand, and
is not a perfect square, because we can bound it between two consecutive
perfect squares:
inLFLFLx,yzijzxyxzyzxzinLyz
Without loss generality, can assume that
Without loss generality, can assume that
fix the proof, should add which the following sentences after the second sentence the proof?
Without loss generality, can assume that
Without loss generality, can assume that
Without loss generality, can assume that
fix the proof, should add which the following sentences after the second sentence the proof?
Without loss generality, can assume that
Without loss generality, can assume that
Without loss generality, can assume that
Thus, inL.
conclude, have shown that a fooling set for Since infinite, not regular.
But, there's something wrong with this proof! Given the above definitions and give values i and
such that fails distinguish and and are either both accepted both rejected
Which statement from the proof not necessarily true?
inL
fix the proof, should add which the following sentences after the second sentence the proof?
Without loss generality, can assume that
Without loss generality, can assume that
Without loss generality, can assume that
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
