retagged by
5,886 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

0 votes
0 votes

Mealy and Moore machines are language acceptors.

→ NPDA(Non deterministic Pushdown Automata) and DPDA(Deterministic Pushdown Automata) are not equivalent in power.
→ NPDA is more powerful than DPDA which means for every language for which a dpda exist, there exist an NPDA but there are some languages that are accepted by NPDA but are not accepted by DPDA.
→ In case of DFA and NFA they are equivalent in power. So for every language accepted by DFA there exists an NFA and vice versa.
Hence,we can’t convert NPDA to DPDA always and we can convert NFA to an equivalent DFA always.

0 votes
0 votes

1.    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.

2.    Finite State automata is language translator. FALSE

       becasue Finite State automata cannot translate a language into another.

3.    NPDA is more powerful than DPDA. TRUE

4.    Mealy machine is more powerful than Moore machine.  FALSE

        because mealy and moore machine have equal power.

Hence option A and C is correct.

Answer:

Related questions

0 votes
0 votes
2 answers
5
admin asked Mar 31, 2020
1,087 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
6
raj_uddeshya157 asked Dec 27, 2023
66 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
7
0 votes
0 votes
0 answers
8