Gate CS-2011 Question Paper With Solutions

Q. 45 A deterministic finite automation (DFA) D with alphabet S = “a,b, is given
below.

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

Answer: (A)

Explanation: