NPDA and DPDA

Question

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

Answer 1

DPDA $\subseteq$ NPDA

Comments

i have doubt in npda

- can we transit from same state to same state with the operation of push and pop

like

(Q0 , x,y)==(Q0, xy)//push

(Q0,x,y)===(Q0,epsilon)//pop

on the same state

???????????????????/

---

Yes you can write in npda

At the time of string execution npda check all possible and for all possibility make a different copy of npda.

---

Yes You can.

---

in the above example there is no saparate npda right

because dpda is subset of npda ?

---

But the above diagram doesn’t accept a empty string

Answer 2

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.