Concept drill

acceptance by empty stack

GATE CSE & IT · Context-Free Languages · 1999-1999

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Hopcroft-Ullman / Dragon Book

Automata, languages, parsing, syntax-directed translation

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

1999 PYQ

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

easyanswer key