论文信息 - Two-way balloon automata and AFL

Two-way balloon automata and AFL

Abstract : 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 two-way balloon automata of (nonerasing) (deterministic) stack acceptors is such a family. (Author)

Seymour Ginsburg | John E. Hopcroft | J. Hopcroft | S. Ginsburg

[1] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.

[2] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[3] Jeffrey D. Ullman. Halting Stack Automata , 1969, JACM.

[4] Jeffrey D. Ullman,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.

[5] Journal of the Association for Computing Machinery , 1961, Nature.