717 views

Which of the following statements is true ?

1. Melay and Moore machines are language acceptors.
2. Finite State automata is language translator.
3. NPDA is more powerful than DPDA.
4. Melay machine is more powerful than Moore machine.

### 1 comment

Option C is correct

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

by

Power(NPDA) > Power(PDA)

1
4,825 views
2
1,169 views
3
1,015 views
1 vote