Two-Way Balloon Automata and AFL

It is shown that if the family of languages accepted by a closed class of two-way balloon automata is closed under length-preserving homomorphism, then this family is an AFL closed under intersection and e-free substitution. It is then proved that the family of languages accepted by the closed class of (nonerasing) (deterministic) stack acceptors is such a family.