DFA For A language

Question

How to draw a DFA having all Strings containing 00 not 000 on the set of string {0,1}?

Answer 1

This is the DFA. There is a dead state at the end.

Comments

$0010$ should be accepted .

---

your DFA is accepting $0$ which it should not.

try this

---

Thanks for pointing out the mistake. I didn't write down the language before making the DFA.