Register

CFL with Empty Stack or Final State

1,917 views
0 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?

 

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · sliding window [opt...Next → · Testbook test series
← Previous in category · SELF DOUBTNext in category → · Proper Prefix
Position:
Show:

Related questions

1 1 vote
0 0 answers
2.5k
2.5k views
Matrix asked Jul 28, 2018
2,498 views
DPDA acceptance by empty stack
Is this approach of acceptance by empty stack correct ?I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
1 1 vote
1 1 answer
582
582 views
vedantk asked Jan 10, 2024
582 views
Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?
0 0 votes
0 0 answers
571
571 views
h4kr asked Dec 23, 2022
571 views
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than...
1 1 vote
1 1 answer
2.8k
2.8k views
Ami Ladani asked Jan 13, 2017
2,783 views
If L is any language accepted by DPDA with stack containing only one symbol. Then L can be