1 votes 1 votes closed as a duplicate of: Push Down Automata which PDA is more Powerful Deterministic or Non Deterministic and why? Theory of Computation theory-of-computation pushdown-automata + – Sunil8860 asked Aug 12, 2017 closed Aug 13, 2017 by Tesla! Sunil8860 336 views comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Aug 12, 2017 reply Follow Share NPDA is more powerful than DPDA. 3 votes 3 votes stblue commented Aug 13, 2017 reply Follow Share https://gateoverflow.in/126388/push-down-automata 3 votes 3 votes Please log in or register to add a comment.