Join our Telegram Channel

Question

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]
Advertisement

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

GkSeries apsc prelims 2023 test series

Today's Top Current Affairs

Current Affairs MCQs

State-wise Current Affairs

General Knowledge

Month-wise Current Affairs 2023

Category-wise Current Affairs

Jobs by Qualification

Free Mock Test