Let's assume we have a DPDA and NPDA .Now if we have a language suppose L which of the above can we use to find if L is regular or not? And why? I found its DPDA BT not NPDA.but what is the intuitive notion.can we use both ways of DPDA I.e using final state or by using empty stack to decide if L is regular or not?