in Theory of Computation
1,230 views
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?

 

in Theory of Computation
by
1.2k views

4 Comments

I think the question should be particularly for DPDA, because for NPDA empty stack PDA is equivalent to final state accepting PDA.
1
1

Example Diffrence

0
0

Please log in or register to answer this question.

Related questions