Minimum number of states required in DFA accepting binary strings not ending in “101” is
Explanation: DFA for accepting strings ending with “101” as shown below :
Now, complement of above DFA will accept binary strings not ending in “101” is :
Therefore, 4 states are required. Option (B) is correct.
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.