retagged by
5,894 views
0 votes
0 votes

Which of the following is true?

  1. Mealy and Moore machine 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.
retagged by

6 Answers

5 votes
5 votes

Answer is C) NPDA is more powerful than DPDA

3 votes
3 votes

(A) Mealy and Moore machine are language acceptors. TRUE
       because Mealy and Moore both are finite state machines.So. both of them are accepting some language.

(B) Finite State automata is language translator. FALSE

      Finite State automata cannot translate a language into another.

(C) NPDA is more powerful than DPDA. TRUE

D) Mealy machine is more powerful than Moore machine.  FALSE

So, the answer will be both A) & C)

2 votes
2 votes
$C$ is correct .

There exist some context-free languages for which it is not possible to construct a DPDA whereas a NPDA can be easily constructed,

Example: Set of all even length palindromes over an alphabet i.e. $L=\left \{ ww^{R} \right \}$ .Here, it is not possible to find the centre of the string deterministically and hence NPDA is used to recognize strings of this language.

This implies NPDA is more powerful than DPDA
Answer:

Related questions

0 votes
0 votes
2 answers
1
admin asked Mar 31, 2020
1,088 views
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.Me...
0 votes
0 votes
0 answers
2
raj_uddeshya157 asked Dec 27, 2023
67 views
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
1 votes
1 votes
1 answer
3
0 votes
0 votes
0 answers
4