Pumping Lemma for RL: A New Introduction

Ultimate Goal of the Pumping Lemma for Regular Languages

$L(M) = A$

Consider String $s$ and its Computation


$q_r$ - The First Repeated State

Divide the computation

Other strings in A?

Pump a String - Defined

Pumping Length

Other Conditions on the Computation

What is True for All Regular Languges

What is True, Using Words

Use PL to Prove $0^n1^n$ is NOT Regular

Thinking About the Above Proof

Thinking About Proving that a Language is Regular

ITEC 420 Course Page