Which of the following language L is/are not accepted by deterministic pushdown automata where ∑ = {a, b, c, d} and m≥ 0, n ≥ 0?
1
\(L = {\rm{\;}}{{\rm{a}}^{\rm{n}}}{{\rm{b}}^{{n^2}}}\)
2
L = ambncndm
3
L = aar | a ϵ (x, y)* where ar is a reversal of string a
4
L = ambm+ncn