Pumping lemma is generally used for proving that

M

Mr. Dubey • 52.30K Points
Coach

Q. 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 : Option (B)

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. which of the following is not an advantage of OpenGL

Q. An assertion that contains one or more variable is called a….

Q. Kohonen self-organizing map referred to

Q. Which of the following is an architectural conflict?

Q. Which formulation of Dijkstra's algorithm exploits more parallelism

Q. In a room containing 28 females, there are 18 females who speak English, 15 females speak french and 22 speak german. 9 females speak both english and

Q. Stack words on:

Q. Which of the following is correct regarding Aggregate functions?

Q. Use of Email instead of post & telegraph is due to

Q. Write the expression for Boolean function F (A, B, C) = m (1,4,5,6,7) in standard POS form.