Question

The number of states in the minimal deterministic finite automaton corresponding to the regular expression is (0+1)*(10)

• A. 3

Answer 1

The correct option is A 3
The given regular expression (0+1)*(10) corresponds to binary string ending with "10". To accept the minimal string "10", we need 3 states. No trap state is required since this is a machine which accpets "ending with" type strings.

So, we need only 3 states. The design of the minimal DFA is shown below.

$\therefore$ Minimum number of states required for DFA = 3.