Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.
and DPDA with empty stack doesnt accept any regular language too becaust it doesn't satisfy prefix property.
can anyone explain this with the help of PDA ?
Just take example of regular language - { a^n, n >= 0 } or any language which doesn't prefix property. I just want to know where it will get stuck on PDA.