Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Given below are two statements
Statement I : The family of context free languages is closed under homomorphism
Statement II : The family of context free languages is closed under reversal
In light of the above statements, choose the correct answer from the options given below
1
Both Statement I and Statement II are true
2
Both Statement I and Statement II are false
3
Statement I is true but Statement II is false
4
Statement I is false but Statement II is true