Nov2017 cs Q21
0. Pumping lemma for regular language is generally used for proving:
- Option : D
- Explanation : Pumping lemma is used to prove a language is regular or not. For more information on pumping lemma Refer:Pumping_lemma So, option (D) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.