DFA & RE from descriptive definition of given regular language
You can always use the current state of the automaton to remember the last three characters you've seen.  Now, you can implement two phases.  In the first phase, you're happy if you're ever in the situation where the last three characters were $010$.  In the second phase, you become unhappy if you ever see $010$ again.