retagged by
38,788 views

4 Answers

Best answer
5 votes
5 votes
The main (and only) difference between DPDA and NPDA is that DPDAs are deterministic, whereas NPDAs are non-deterministic. With some abuse of notation, we can say that NPDAs are a generalization of DPDAs: every DPDA can be simulated by an NPDA, but the converse doesn't hold (there are context-free languages which cannot be accepted by a DPDA).

The main advantage of DPDAs is that we can simulate them much more easily with our deterministic computers (real hardware is always deterministic). In fact, simulating general DPDAs is not fast enough for most purposes, and so when parsing code we usually use LALR grammars which are weaker than DPDAs.
edited by
3 votes
3 votes

L={wwR / w ∊ (a,b)+}

For  this DPDA is not possible.we must use NPDA.

Every DPDA contain equivalent NPDA,

but,every NPDA may not contain equivalent DPDA sometimes.

1 votes
1 votes

The difference between DPDA and NPDA can also be seen by their diffinitions:---

Definition of DPDA :                                                                                                                                                                                                                                                                

Definition of NPDA(PDA) :

                                                                                                                                                                             

0 votes
0 votes
The difference between a Deterministic Pushdown Automata (DPDA) and a Non-Deterministic Pushdown Automata (NPDA) is that a DPDA always makes a deterministic move from one state to the next, while an NPDA may make multiple non-deterministic moves from a single state. Additionally, a DPDA cannot have any empty transitions, while an NPDA can have empty transitions.

Related questions

0 votes
0 votes
2 answers
2
akankshadewangan24 asked Jul 6, 2017
2,417 views
Can we make NPDA? L= {anbn| n>=0,a,b are input variables}if yes then make it .
8 votes
8 votes
3 answers
3
2 votes
2 votes
0 answers
4
Shubhanshu asked Aug 28, 2017
2,556 views
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.