Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
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?
1
(a) only
2
(b) only
3
(c) only
4
None of (a), (b) and (c)