Pumping lemma is generally used to prove that?

(A) A given language is infinite
(B) A given language is not regular
(C) Whether two given regular expressions of a regular language are equivalent or not
(D) None of these

►Correct Option

Latest Jobs in Pakistan	Govt Jobs in Pakistan	Private Jobs in Pakistan
NTS Jobs	PPSC Jobs	FPSC Jobs
Teaching Jobs	NADRA Jobs	Bank Jobs
English Mcqs	General Knowledge Mcqs	Pak Studies Mcqs
Current Affairs Mcqs	Current Affairs Mcqs PDF	Current Affairs of Pakistan
Books PDF	Notes PDF	Islamic Studies Mcqs

Leave a Reply Cancel reply