Minimum number of states required in DFA accepting binary strings not ending in $\text{“101”}$ is
$\color{red}{\text{Detailed Video Solution:}}$ https://youtu.be/VE71CxKb390
Answer :- B
First make DFA which recognizes binary strings ending with 101, then complement it (make non-final states as final states and vice-versa)
final answer you will get is this .
Answer: b) 4
Three final states and one non-final state.
64.3k questions
77.9k answers
244k comments
80.0k users