Gate CS-2007 Question Paper With Solutions

Q. 85 Consider the following Finite State Automation

The minimum state automaton equivalent to the above FSA has the following

number of states

(A) 1

(B) 2

(C) 3

(D) 4

Answer: (B)

Explanation: