0^3m over the alphabets {0,1} , m E I+ is a regular language right? We can draw the DFA for it.
Which means it cannot be tested using pumping lemma for regularity, but since we already know it is regular, whenever we take any string generated by L and pump it, it should always be a member of the strings in L(M), right?
So, if I take 0^3p , p as the Pumping lemma const.,
Then |xyz| >p .
|xy|<p => |y| < p => pumping y we have 0^(3p+k) .
We can take |y|=1 without violating the pumping lemma constrains , so that on pumping, we have 0^(3p+1) , not acceptable by the machine.
Where have I messed up?