9th Annual Symposium on Switching and Automata Theory (swat 1968) (1968)
Oct. 15, 1968 to Oct. 18, 1968
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1968.41
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 ε-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.
S. Ginsburg and J. Hopcroft, "Two-way balloon automata and AFL," 9th Annual Symposium on Switching and Automata Theory (swat 1968)(FOCS), vol. 00, no. , pp. 292-297, 1968.