GATE CS 2017 (Afternoon) — Question 39

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ2 marks · −2/3 if wrongMedium

Let \(\delta\) denote the transition function and \(\hat{\delta}\) denote the extended transition function of the \(\epsilon\)-NFA whose transition table is given below:
Question image
The \(\hat{\delta}(q_2, aba)\) is
  1. A
    \(\phi\)
  2. B
    \(\{q_0, q_1, q_3\}\)
  3. C
    \(\{q_0, q_1, q_2\}\)
  4. D
    \(\{q_0, q_2, q_3\}\)
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group