State and prove the Pumping lemma for the regular languages. How can you show with example that pumping lemma is used to prove that a given language is not regular? Explain.

This answer is restricted. Please login to view the answer of this question.

Click here to submit your answer.

0 Comments

Oldest

Newest Most Voted

Inline Feedbacks

View all comments

Question