engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following definitions will not generate the same languages as L, where L = { xnyn, n ≥ 1 }
1
E → xEy | xy
2
xy | x+xyy+
3
x+y+
4
x*xyy*