Answer
with $s_0$, $s_1$, and $s_2$ as the final states language what will be derived would be that is explained in step by step process
Work Step by Step
deterministic finite-state automaton that recognizes the set of all bit strings that do not contain the string 101.
--with $s_0$,
Start state $s_0$, only final state $s_0$; transitions
from $s_0$, to $s_0$, on 0,
--with $s_1$,
Start state $s_0$, only final state $s_1$; transitions
from $s_0$, to $s_0$, on 0,
from $s_0$, to $s_1$, on 1,
--with $s_2$,
Start state $s_0$, only final state $s_2$; transitions
from $s_0$, to $s_0$, on 0,
from $s_0$, to $s_1$, on 1,
from $s_0$, to $s_2$, on 0,
