Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Consider the following statements about Context Free Language (CFL):
Statement I: CFL is closed under homomorphism.
Statement II: CFL is closed under complement.
Which of the following is correct?
1
Statement I is true and Statement II is false
2
Statement II is true and Statement I is false
3
Both Statement I and Statement II are true
4
Neither Statement I nor Statement II is true