Solved

Pumping Lemma Is Generally Used for Proving That

Question 33

Multiple Choice

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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q28: The language accepted by a Push down

Q29: For two regular languages L<sub>1</sub> = (a

Q30: Which statement is true?<br>A)The PDA must have

Q31: Which of the following problem is undecidable?<br>A)Membership

Q32: The following CFG is in S ?

Q34: Match all items in Group 1 with

Q35: Consider the following statements<br>I. Recursive languages are

Q36: All NonNull words of the CFL can

Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?

Q38: Let S and T be language over