2 votes 2 votes Which one is more powerful Deterministic push down automata or Non Deterministic push down automata ? EKANSH asked Apr 21, 2017 EKANSH 4.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 7 votes 7 votes NPDA(Non Deterministic Push Down Automata) is more powerful than DPDA(Deterministic Push Down Automata). for eg: There are languages for which we can make NPDA but DPDA can not be possible... L = { WW^r | W belongs to (a + b)^(+) } akash.dinkar12 answered Apr 21, 2017 • selected Apr 21, 2017 by srestha akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes expressive power of DPDA < expressive power of NPDA ie. language accpeted by deterministic PDA is greater then Non deterministic PDA therefore NPDA is more powerful then DPDA akankshadewangan24 answered Apr 30, 2017 akankshadewangan24 comment Share Follow See 1 comment See all 1 1 comment reply shashank joshi commented Nov 18, 2018 reply Follow Share is it right language accepted by pda is more than npda? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes non deterministic push down automata is more powerfull krishi answered May 10, 2017 krishi comment Share Follow See all 0 reply Please log in or register to add a comment.