Minimum number of states in a DFA accepting binary strings ending with '01'?
Minimum number of states in a DFA accepting binary strings ending with '01'?
Answer
3
Theory
DFA states represent the progress toward matching the pattern.
Solution
States: q0 (start), q1 (saw 0), q2 (saw 01, accepting). Total = 3.