Register

CFL with Empty Stack or Final State

1,512 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?

 

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Matrix asked Jul 28, 2018
1,545 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.
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.
User Avatar
1 votes
1 votes
1 answer
2
vedantk asked Jan 10
154 views
Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?
If it’s DCFL then also construct the DPDA ?
User Avatar
2 votes
2 votes
0 answers
3
h4kr asked Dec 23, 2022
287 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 stack? Please tell how would check for the grammer of this language even if it is in CSL. Thank you
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 th...
User Avatar
Link Copied!