Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 6

• retagged by
1,109 views
0 votes
0 votes

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.
• retagged by
User Avatar

2 Answers

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

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
6 answers
1
admin asked Mar 30, 2020
5,973 views
NIELIT 2017 DEC Scientist B - Section B: 39
Which of the following is true? Mealy and Moore machine are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
Which of the following is true?Mealy and Moore machine are language acceptors.Finite State automata is language translator.NPDA is more powerful than DPDA.Melay machine i...
User Avatar
2 votes
2 votes
4 answers
2
admin asked Mar 31, 2020
1,669 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 3
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
User Avatar
2 votes
2 votes
3 answers
3
admin asked Mar 31, 2020
1,602 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
User Avatar
1 votes
1 votes
4 answers
4
admin asked Mar 31, 2020
3,704 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : Union Dot Kleene None of the options
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
User Avatar
Link Copied!