0 votes 0 votes $1)$"We can solve same PDA with empty stack and using final state" Can give an example of such language? Where is the difference between solving a pda with empty stak and by accepting final state? I got this link but without example https://cs.stackexchange.com/questions/66924/push-down-automata-acceptance-by-empty-stack-and-final-state $2)$If language has prefix property, why it cannot be solved with empty stack? Theory of Computation theory-of-computation context-free-language pushdown-automata + – srestha asked Oct 4, 2018 srestha 1.5k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply daksirp commented Oct 4, 2018 reply Follow Share https://gateoverflow.in/165012/deterministic-pushdown-automata-prefix-property 2 votes 2 votes !KARAN commented Oct 4, 2018 reply Follow Share I think the question should be particularly for DPDA, because for NPDA empty stack PDA is equivalent to final state accepting PDA. 1 votes 1 votes daksirp commented Oct 5, 2018 reply Follow Share Example Diffrence 0 votes 0 votes MiNiPanda commented Oct 6, 2018 reply Follow Share https://gateoverflow.in/249558/acceptance-languages-dpda-with-empty-stack-npda-empty-stack 1 votes 1 votes Please log in or register to add a comment.