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

Finite Automata (DFA, NFA, Regular Expressions) question bank (Theory of Computation & Automata)

Practice 7 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Theory of Computation & Automata - Finite Automata (DFA, NFA, Regular Expressions) questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
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
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Finite Automata (DFA, NFA, Regular Expressions) Concept 6] 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
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 7 Questions in Finite Automata (DFA, NFA, Regular Expressions)

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

Sign in to unlock Create free account

Sign up free to access all 7 questions

Unlock every Finite Automata (DFA, NFA, Regular Expressions) question, generate papers, and practice at your own pace.

Start free