# Does a PDA (push down automaton) always need to have an empty battery after reaching the final state?

I am learning PDA and trying to build a PDA for { $$a ^ i b ^ j c ^ k mid i, j, k geq1, (i! = j$$ or j! = k)}.

For this I drew this.

$$q2, q4, q5$$ The states are for condition j! = k.

$$q1, q3$$ The states are for condition i! = j.

$$q6$$ it is the final state

It may have some stack elements even after the state. $$q5$$ because for condition b! = c, if not. of $$c$$ it's less than not $$b$$ (ie- k> j), extra $$b$$ will remain on the stack in state q5 (when all $$c$$ there is no more, that is, the chain has ended).

Is this the right PDA? If not, which should be the correct one.