engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the following language ∑ = {x, y}:
L1 = {xn+m yn xm | n, m ≥ 0}
L2 = {xn+myn+m xn+m |n, m ≥ 0}
Which of the below given options is/are incorrect
1
L1 is not accepted by deterministic Pushdown Automata
2
L2 is accepted by non deterministic Pushdown Automata
3
L2 is accepted by Linear Bounded Automata
4
L1 is accepted by one of the Finite Automata