NFSA Example

stateDiagram
[*] --> q0
q0 --> q1 : 0
q0 --> q0 : 0
q1 --> q2 : 1
q2 --> q0 : 1, eps
q2 --> [*]

With $\Sigma =\{0,1\}$

Describe the Language $\mathcal{L}(M)$

$\mathcal{L}(M)=\{x\in {\Sigma }^{\ast }|x\text{ ends with 01}\wedge x\text{ starts with 0}\wedge \text{ 111 is not a substring of }x\}$ Note that regex $M=(0+01+011{)}^{\ast }01$