Nielit STA 17-12-2017

Question 6

Which of the following statement is true?

A	mealy and moore machine are language acceptors
B	Finite state automata is language translator
C	NPDA is more powerful than DPDA
D	mealy machine is more powerful than moore machine

Theory-of-Computation

Question 6 Explanation:

→ NPDA is more powerful than DPDA because
1.DPDA accept only a proper subset of CFL’s ie. LL grammars.
2.NPDA can accept any CFL, which makes them more powerful over DPDA

Correct Answer: C

Question 6 Explanation:

→ NPDA is more powerful than DPDA because
1.DPDA accept only a proper subset of CFL’s ie. LL grammars.
2.NPDA can accept any CFL, which makes them more powerful over DPDA