in Theory of Computation edited by
2,440 views
0 votes
0 votes

Can we make NPDA?  L= {anbn| n>=0,a,b are input variables}
if yes then make it .

in Theory of Computation edited by
2.4k views

2 Answers

1 vote
1 vote
Best answer

DPDA $\subseteq$ NPDA

selected by

4 Comments

Yes You can.
1
1
in the above example there is no saparate npda right

because dpda is subset of npda ?
0
0
But the above diagram doesn’t accept a empty string
0
0
0 votes
0 votes

Yes we can make NDPDA. we can also make DPDA with acceptance using final state but we cannot make DPDA with acceptance using empty stack as Language L has prefix property.

 

Related questions

5 votes
5 votes
4 answers
2