Direction: Consider the following Finite State Automata:
-
The language accepted by this automata is given by the regular expression
-
- b * ab * ab * ab
- (a + b)*
- b* a (a + b)*
- b * ab * ab *
- b * ab * ab * ab
Correct Option: B
The FSA as obtained in the previous question is b* a (a + b)*
The minimum number of states are thus given by
q0 and q1 are the state: that are required at most and hence the minimum number of states is 2 (q0 and q1).
