1 votes 1 votes True/False 1. In PDA, if Final state = phi(empty) ,then language accepted =phi. 2. In PDA, if Final state != phi(empty) ,then PDA will always accept at least one string.. Theory of Computation theory-of-computation pushdown-automata context-free-language + – rahul sharma 5 asked Aug 2, 2017 rahul sharma 5 607 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes In PDA we can either accept by final state or empty stack. 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. 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. aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.