Session-17.pdf

# Session-17.pdf - Pumping Lemma 0 F with n states accepting...

• 1

This preview shows page 1. Sign up to view the full content.

Pumping Lemma: 0 , F) with n states accepting L. Let w L (M) and x,y,z such that w=xyz, i z Proof: Let L be a regular set. Then 0 , F) with n states accepting L. Let w L(M) and |w|=m =>w = a 1 a 2 a 3 m 0 , a 1 a 2 a 3 j ) = q j Let Q be all such q j So, some of states are repeating Let q j = q k ----- (1) Let x = a 1 a 2 a 3 j y = a j a j+1
This is the end of the preview. Sign up to access the rest of the document.
• Fall '14
• rani
• Formal languages, Regular expression, Regular language, Pumping lemma for regular languages, L. Let

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern