Minimum number of states required in DFA accepting binary strings not ending in $”101”$ is
Answer :- B
first make DFA which ends with 101 . then complement it (make initial state as final state and vice-versa)
final answer you will get is this .
Answer: b) 4
Three final states and one non-final state.