A regular expression for an automaton which accepts strings with no more than 3 consecutive zeros
Hint: A string with no more than 3 consecutive zeroes has the general form
$$0^{p_1} 1 0^{p_2} 1 0^{p_3} 1 \ldots,$$
where $p_i \leq 3$. Try expressing that structure as a regular expression.