Pumping lemma is generally used for proving that
| A. | given grammar is regular |
| B. | given grammar is not regular |
| C. | whether two given regular expressions are equivalent or not |
| D. | None of these |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
