I have to write the language of the below $NPDA$(Non-Deterministic Push Down Automata).
I think that from $q_0$ to $q_1$ and then $q_2$, we are actually building the below all the strings of $0$'s and $1$'s of the form $a^nb^n$ with the lenght at least 2.
But there is also a transition from $q_2$ to $q_0$, which makes a cycle, and it just read a $1$ from input string. For example these strings are accepted by this machine, and the point is that in all of them the last character is $0$.
1100 1 10 1 1100
111000 1 1100 1 10
1100
But, unfortunatly I don't know how to write its language accuratly. My idea was to write something like the below language:
$L = \{ w(1^n) z (0^n) | w ∈ L \}$ and $z ∊ \{1,ɛ \}$
But it is not correct. I will be grateful for any help.