# Creating a PDA for the language L = {$a^{m}$ $b^{n}$ : m $\neq$ n}

I didn‘t find a DPDA for the language L = {$$a^{m}$$ $$b^{n}$$ : m $$\neq$$ n}, so I guess an NPDA is the only option.

NPDA are not very intuitive to me. The only solution I found online is:

I don‘t really understand how it works and also I‘m not allowed to use final states. The only way an input is accepted is by emptying the Stack (how we do it at my university).