Consider the language PALIN U ODD. We will use the pumping lemma to prove it is...

Transcribed Image Text:

Consider the language PALIN U ODD. We will use the pumping lemma to prove it is not regular and pump on w = abba". What values of i will work to pump out of the language? Reminder: since the first n symbols are all a's we must have y =al for some j and i is the number of times we loop or pump on y. (i) i=0 (ii) i = 1 (iii) i = 2 (iv) i=3 Exactly 3 of them Exactly 1 of them Exactly 2 of them All 4 of them Consider the language PALIN U ODD. We will use the pumping lemma to prove it is not regular and pump on w = abba". What values of i will work to pump out of the language? Reminder: since the first n symbols are all a's we must have y =al for some j and i is the number of times we loop or pump on y. (i) i=0 (ii) i = 1 (iii) i = 2 (iv) i=3 Exactly 3 of them Exactly 1 of them Exactly 2 of them All 4 of them