Hello Justin

Hi

What is your question?

Could you check my previous comment.

What about string aaaab?

Yes of course

What is the question about aaaab?

Since the string aaaab isn't accepted does this obey the pumping lemma?

No, it will not, because for i = 1 , whatever partition you choose, it will still be aaaab. Therefore naturally xy^iz may or may not belong to L. You can not say anything.

Do you mean to say that pumping lemma says that a string represented in xy^iz may or may not belong to L?

When conditions of pumping lemma are met then only can you say that xy^iz in L.

When conditions are not met, you can not say whether the string will or will not belong to L.

Could you tell the conditions that are not met by the string aaaab

All bets are off, when conditions are not met.

First condition, w belongs to L

w should belong to L

After then only question of partitioning arises.

Oh I haven't learned that till now.Now I got it.

Okay, then bye.

Yeah thanks again for your cooperation.

Could you help me with this comment.I couldn't get why the minimum pumping length for language {a} is 2?