Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 06, 2013

Pumping lemma is generally used for proving that

Choose the correct answer:

A) given grammar is regular

B) given grammar is not regular

C) whether two given regular expressions are equivalent or not

D) given grammar is equivalent

Detailed Explanation

Option b is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback