I am trying to create a finite automate that would accept any strings that have at least to 0s but reject all strings that have consecutive 0s. I have designed a deterministic finite automaton (DFA) for this purpose but am having trouble generating a regex from it.
The checked boxes are accepting states. Thank you!
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.