Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 2011 | Question 45

  • Last Updated : 28 Jun, 2021

A deterministic finite automation (DFA)D with alphabet {a,b} is given below

GATE2011AT1

Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?

GATE2011AT2
GATE2011AT3
(A) A
(B) B
(C) C
(D) D


Answer: (A)

Explanation: Options (B) and (C) are invalid because they both accept ‘b’ as a string which is not accepted by give DFA. (D) is invalid because it accepts “bba” which are not accepted by given DFA.

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :