# Formal definition of an empty stack accepting PDA

PDA's are usually defined using the 7-tuple convention.

$$M=(Q, \Sigma, \Gamma, \delta, q_{0}, Z, F)$$

F is the set of accepting states.

I want to design a PDA accepting by empty stack, so using this notation makes no sense, as I don't need F and I want to make the acceptance condition clear.

How is this usually done? Can I just dismiss F?

$$M'=(Q, \Sigma, \Gamma, \delta, q_{0}, Z)$$