engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Which of the following statement is/are true?
1
Pushdown automata = Finite automata + 0 stack
2
Pushdown automata = Finite automata + 1 stack
3
Deterministic pushdown automata is a subset of nondeterministic pushdown automata.
4
Non deterministic Pushdown Automata and Deterministic Pushdown Automata are equivalent in power.