Pushdown automata (PDA) is equivalent in power to:

Pushdown automata (PDA) is equivalent in power to:

a) regular expressions
b) context-free grammars
c) context-sensitive grammars
d) Turing machines

From the BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 24 of 123.

More from this paper

Previous: ________ algorithm is used to find a shortest path in a positive weighted graph.
Next: ________ operates at the network layer and is used to connect different networks.
All questions in BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC)