GATE & PSUs - Computer Science & Information Technology (CS & IT)

Context-Free Grammars & Pushdown Automata question bank (Theory of Computation & Automata)

Practice 7 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Theory of Computation & Automata - Context-Free Grammars & Pushdown Automata questions with answers and step-by-step solutions.

Start free Book a demo

All Hard Medium

Q1.

[Context-Free Grammars & Pushdown Automata Concept 3] Let $L_1$ be a recursive language and $L_2$ be a recursively enumerable (RE) but NOT recursive language. Which of the following languages is GUARANTEED to be recursively enumerable?

(A)

$L_1 \cup L_2$

(B)

$\overline{L_2}$

(C)

$L_1 \setminus L_2$

(D)

$L_2 \setminus L_1$

Show answer & solution

Verified Answer & Solution Locked

Q2.

[Context-Free Grammars & Pushdown Automata Concept 8] Let $L_1$ be a recursive language and $L_2$ be a recursively enumerable (RE) but NOT recursive language. Which of the following languages is GUARANTEED to be recursively enumerable?

(A)

$L_1 \cup L_2$

(B)

$\overline{L_2}$

(C)

$L_1 \setminus L_2$

(D)

$L_2 \setminus L_1$

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 7 Questions in Context-Free Grammars & Pushdown Automata

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 7 questions

Unlock every Context-Free Grammars & Pushdown Automata question, generate papers, and practice at your own pace.

Start free