607 views

1 Answer

0 votes
0 votes

In PDA we can either accept by final state or empty stack.

  1. In PDA, if Final state = phi(empty) ,then language accepted =phi. is False because if PDA is acceptance by empty stack then there is no need for final state.
  2. In PDA, if Final state != phi(empty) ,then PDA will always accept at least one string. is false because even if there is final state it is not necessary that there must be move to reach that final state. if initial state is final state then this statement is true.

Related questions

1 votes
1 votes
1 answer
2
0 votes
0 votes
1 answer
3
shekhar chauhan asked Jun 15, 2016
2,195 views
What does this Language Represents ? And what is the machine which is able to represent this Language.L = { a^i b^j c^k d^l } where i = k or j = lHow it is different fro...
0 votes
0 votes
1 answer
4
akshat16 asked Sep 7, 2017
1,139 views
construct a pda fora^mb^n such that m=2n+1?