DFA multiple accepting states to Regular expression
Your DFA accepts all words not containing $aaa$. Such words are built of the following "building blocks": $b,ab,aab$. Additionally, a word may end with $a,aa$. In total, we get the regular expression
$$
(b+ab+aab)^*(\epsilon+a+aa).
$$