Question

The minimum number of states in a DFA accepting \( L = \{ w | w \text{ ends with } 01 \} \) over \( \Sigma = \{0, 1\} \) is _______ .

• A. 2
• B. 3
• C. 4
• D. 5

Hint:

For regular languages, the minimum number of states in a DFA depends on the pattern or condition being checked, such as "ends with 01."

Answer 1

The Correct Option is B

A DFA that accepts strings ending with "01" needs at least three states: one to track if the last character was a "0", another to track if the last character was a "1", and a third to indicate the final acceptance state when the string ends with "01". 
Therefore, the minimum number of states required is 3.