FINITE AUTOMATA: PUMPING LEMMA

Let is not regular. Note that, .

Select for some simple string v.

Prove by the pumping lemma that A is not regular.

V. ge