Answer
8 Transitions occur
Work Step by Step
finite-state automaton that recognized the set of complete bit strings that contain the string $101$.
Start state $s_0$, only final state $s_3$;
transitions
-from $s_0$ to $s_0$ on 0,
-from $s_0$ to $s_1$ on 1,
- from $s_1$ to $s_2$ on 0,
-from $s_1$ to $s_1$ on 1,
-from $s_2$ to $s_0$ on 0,
- from $s_2$ to $s_3$ on 1,
-from $s_3$ to $s_3$ on 0,
-from $s_3$ to $s_3$ on 1
