GATE | GATE CS 2011 | Question 45

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

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

(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

My Personal Notes arrow_drop_up

Save