Let L_D be the set of languages accepted by a PDA by final state, and L_F be…

PYQ GATE 1999

Let L_D be the set of languages accepted by a PDA by final state, and L_F be the set of languages accepted by a PDA by empty stack. Which of the following is true?

  1. A.

    L_D = L_F

  2. B.

    L_D is a proper subset of L_F

  3. C.

    L_F is a proper subset of L_D

  4. D.

    None of the above

Attempted by 200 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…