4.2 Pumping Lemma

Question 1

What is the lumping lemma (P1, P2, P3)

Answer 1

Basically means that each automata has a loop

Question 2

What is the brief explaination of pumping lemma P1, P2, P3

Answer 2

Question 3

What is the proof structure / pattern, using the pumping lemma to prove that a lanugage is not regular

Answer 3

Question 4

Prove this

Answer 4

Question 5

Prove this

Answer 5

Question 6

Can the pumping lemma prove a lanugage is regular?

Answer 6

No, the pumping lemma can only prove a language is not regular. There exist irregular lanugages which can still be pumped.