UGC NET PAPER 2 June 2019 Question 77 (Shift-I)

77. How can the decision algorithm be constructed for deciding whether context-free language L is finite?
(a) By Constructing redundant CFG in CNF generating language L
(b) By constructing non-redundant CFG G in CNF generating language L
(c) By constructing non-redundant CFG in CNF generating language L-{∧} (∧ stands for null)
Which of the following is correct?

A (a) only

B (b) only

C (c) only

D None of (a),(b) and (c)

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 76	UGC NET CS 2018 July - II Question 78