Two-way balloon automata and AFL
- 1 October 1968
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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 ε-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.Keywords
This publication has 2 references indexed in Scilit:
- An Approach to a Unified Theory of AutomataBell System Technical Journal, 1967
- Stack automata and compilingJournal of the ACM, 1967