Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
For the regular languages and context free languages which is not correct ?
A. both are closed under union operation
B. both are closed under concatenation operation
C. both are closed under intersection operation
D. both are closed under complementation operation
E. both are closed under keen star operation
Choose the most appropriate answer from the options given below :
1
A and B Only
2
B and C Only
3
C and D Only
4
D and E only