Pumping lemma is generally used for proving

A a given grammar is regular

B a given language is not regular

C whether two given regular expressions are equivalent

D none of the above

Answer & Explanation
Option: [B]

Take Mock Tests

Government Schemes Mock Test	Start Test!
Political Science Mock Test – 42	Start Test
History Test – 190	Start Test
Quantitative Aptitude Test	Start Test!
Trigonometry - Mock Test	Start Test!
Data Interpretation - Mock Test	Start Test!
General Awareness - Mock Test	Start Test!
Reasoning Ability - Mock Test	Start Test!
Englist(Antonyms) Mock Test 1	Start Test!
Quantitative Aptitude (Percentage) Mock Test	Start Test!
Economy Mock Test 1	Unlock Test!
Books & Authors - Test 2	Unlock Test!