GATE CS 2017 Set 2 — Question 39

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+2 / -0.67MediumNFAFinite Automata & Regular LanguagesTheory of Computation

Theory of Computation → Finite Automata & Regular Languages → NFA

Last updated

Question

Let δ\delta denote the transition function and δ^\hat{\delta} denote the extended transition function of the ϵ\epsilon-NFA whose transition table is given below:
δ\deltaϵ\epsilonaabb
q0\rightarrow q_0{q2}\{q_2\}{q1}\{q_1\}{q0}\{q_0\}
q1q_1{q2}\{q_2\}{q2}\{q_2\}{q3}\{q_3\}
q2q_2{q0}\{q_0\}\emptyset\emptyset
q3q_3\emptyset\emptyset{q2}\{q_2\}
Then δ^(q2,aba)\hat{\delta}(q_2, aba) is
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Finite Automata & Regular Languages