Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Let A= {a, b} and L = A*. Let x = {anbn, n > 0}. The languages L ∪ X and X are respectively :
1
Not regular, Regular
2
Regular, Regular
3
Regular, Not regular
4
Not Regular, Not Regular