2,277 views
1 votes
1 votes
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.

1 Answer

Related questions

0 votes
0 votes
0 answers
1
radha gogia asked Dec 14, 2015
501 views
I have gone through this link already but still couldn't catch up the logic , so please clarify what is it trying to convey ? http://cs.stackexchange.com/questions/44195/...
7 votes
7 votes
1 answer
3
Himanshu1 asked Jan 3, 2016
3,032 views
" DPDA acceptance with empty stack" & " DPDA acceptance with Final State" are not equivalent. Comment on their dissimilarities & why they are not equivalent ?