Question

The minimum state automation equivalent to the below FSA has the following number of states?

(a) 1

(b) 2

(c) 3

(d) 4

I had been asked this question by my college professor while I was bunking the class.

I'm obligated to ask this question of Minimization of DFA topic in portion Finite Automata and Regular Expression of Compiler

Answer 1

Right choice is (b) 2

The explanation is: State q0 can be omitted because it takes the same input as state q1 hence by removing q0 nothing changes.

 Following is equivalent FSA with 2 states.