Number of states in a minimal Deterministic Finite Automata that accepts the set of strings over the alphabet {a, b} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted);are_____
Now the given Answer is this but I drew another diagram, but I don’t seem to find what is wrong in my diagram and why it cannot be used as a minimal DFA diagram
My diagram:
Given Answer: