0 votes 0 votes Which of the following statements is true ? Melay and Moore machines are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine. Theory of Computation nielit2017dec-assistanta theory-of-computation dpda npda + – admin asked Mar 31, 2020 • retagged Aug 24, 2020 by Lakshman Bhaiya admin 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Mar 31, 2020 reply Follow Share Option C is correct 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 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)^+ $} So C is correct. Ref: https://gateoverflow.in/126388/push-down-automata https://stackoverflow.com/questions/54059449/how-and-why-non-deterministic-pda-is-more-powerful-than-deterministic-pda https://cs.stackexchange.com/questions/56424/difference-between-dpda-and-npda smsubham answered Mar 31, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option C is correct answer Power(NPDA) > Power(PDA) Himanshu Kumar Gupta answered Sep 20, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.