Dfa identify the language accepted by the following dfa

Question

Accepting language is1- [(1^*0)^*01^*]^*0^* 

Or 2-   (1^*0)^*0]^*0^*  any of these is correct??

Comments

Both are wrong

it is as simple , all strings over {$0,1$} ending with $00$ , having regular expression $(0+1)^*00$

so to check regular expression , atleast must reject $\epsilon ,0 $

---

True.. Thanks

Answer 1

the minimal string accepted by this language is 00, so any combination {0,1} followed by 00 can be accepted by the language it can be represented as (0+1)* 00  (ie(0+1)* include empty string also so if (0+1)* is empty then the 00 that is the minimal string accepted by the language. so it can be represented as a (0+1)* 00.