704 views

1 Answer

1 votes
1 votes

Ans. C

 

When you're considering PDA, acceptance by empty stack and acceptance by the final state are equivalent.

But in the case of DPDA, acceptance by the empty stack is weaker, since the language has to satisfy the prefix property

Prefix Property: A language L has prefix property if w∈ L implies no proper prefix of w is in L.

  • When you consider the language L = {an | n >= 0 }
    • It does not satisfy the prefix property, so we cannot construct a DPDA with the empty stack which accepts this language. 

Related questions

0 votes
0 votes
0 answers
1
shivangi5 asked Dec 1, 2017
452 views
Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...
0 votes
0 votes
0 answers
2
NIKU asked Sep 16, 2017
348 views
draw a deterministic PDA forambn where, m = 2n+1
1 votes
1 votes
1 answer
3
ashutoshaay26 asked Aug 15, 2017
1,122 views
What is main difference between Deterministic Push down automata and simple Push down automata ?
0 votes
0 votes
1 answer
4
hrcule asked Mar 21, 2018
663 views
Is true..? In an unambiguous grammar every string has exactly one derivation.