Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
1
2n − 1
2
2n
3
n + 1
4
n2